• MoonMelon@lemmy.ml
    link
    fedilink
    English
    arrow-up
    107
    ·
    2 days ago

    Actually one of my most favorite memories because the simplicity of the solution using recursion blew my little mind. It was like discovering a magic spell.

    • Corbin@programming.dev
      link
      fedilink
      English
      arrow-up
      35
      ·
      1 day ago

      I remember learning recursion twice: once for Fibonacci and once for Hanoi. It did take a while to click but it unlocked recursion schemes and dynamic programming.

    • Gonzako@lemmy.world
      link
      fedilink
      arrow-up
      17
      arrow-down
      1
      ·
      1 day ago

      To me it was an example that there are some problems only solved by recursion but that they also overblown in their relevancy