/
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. 04.07.2021 at 09:08 am / Learning D3 with P5/Processing
  2. 13.02.2020 at 10:29 am / The Code Language Lawyers
  3. 16.12.2017 at 12:00 am / When Defying Simplicity
  4. 15.12.2017 at 12:00 am / The Python Paradox
  5. 08.12.2017 at 12:00 am / The Song of Java Braces
  6. 03.01.2014 at 12:00 am / Write With Vigour
  7. 29.11.2013 at 12:00 am / 美しい - Beautifully Woolly
  8. 24.08.2010 at 12:00 am / Correspondences With Matt Treyvaud
  9. 22.08.2010 at 12:00 am / 柿が赤くなると医者が青くなる
© Wan Zafran. See disclaimer.