/
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. 02.04.2023 at 01:03 pm / Witching May Die, But Not Litigation
  2. 29.03.2023 at 09:38 am / Moving Away from Todoist - to Taskwarrior, SSH & Dropbox - Part 1
  3. 10.07.2021 at 01:46 pm / Plants Are Maths
  4. 02.01.2018 at 12:00 am / Genuinely Technical Modesty
  5. 08.12.2017 at 12:00 am / The Song of Java Braces
  6. 16.10.2015 at 12:00 am / Don Ted E. Bear Waltz - Guitar Arrangement (Sam & Max)
  7. 11.12.2013 at 12:00 am / Lighting Wizardry
  8. 29.11.2013 at 12:01 am / 美しい - Beautifully Woolly
  9. 29.11.2013 at 12:00 am / ガラケー Garakei Evolution
  10. 15.03.2012 at 12:00 am / Cel-Shaded Arena
© Wan Zafran. See disclaimer.