/
14.12.2018 at 03:09 pm
Cuttings

Recursion, Succinctly Put

The rules of recursion.

... There are 3 rules for recursion:

  1. A recursive algorithm must have a base case.

  2. A recursive algorithm must change its state and move toward the base case.

  3. A recursive algorithm must call itself, recursively.

A base case just means that it has an end point, something to stop it looping infinitely, such as when a particular variable reaches zero.

Changing its state means that through each iteration it gets closer to this variable.

Calling itself just means that you call the function that you're currently in with this new data to pass in.

- Reddit
Reference

Filed under:
#
Words: 103 words approx.
Time to read: 0.41 mins (at 250 wpm)
Keywords:
, , , , , , , , ,

Other suggested posts

  1. 18.06.2022 at 06:52 pm / Strangling Deeds
  2. 11.02.2021 at 01:13 am / 46 Simple Python Exercises/#02
  3. 25.08.2020 at 08:42 am / Triple Buffered Painters
  4. 20.08.2020 at 08:59 pm / A Case for Legalese (Or Not)
  5. 14.01.2020 at 01:24 pm / Third Time's A Charm
  6. 16.12.2017 at 12:00 am / When Defying Simplicity
  7. 12.03.2016 at 12:00 am / Transcript of Tifa Funk - Interlude Solo (Tifa's Theme by Tetrimino)
  8. 20.06.2015 at 12:00 am / Mike Tyson on (His) Lawyers
  9. 30.11.2013 at 12:00 am / Particle Oranges
  10. 11.11.2013 at 12:00 am / 下戸 - Lower House
© Wan Zafran. See disclaimer.