• Nommer@sh.itjust.works
    link
    fedilink
    arrow-up
    4
    ·
    10 months ago

    Could your folder tree problem also be solved with a whole loop instead? I’m very new but it seems like recursion is harder but possibly more optimized approach to loops or am I incorrect here?

    • mercator_rejection@programming.dev
      link
      fedilink
      arrow-up
      8
      ·
      10 months ago

      Any recursive algorithm can be made iterative and vise versa. It really depends on the algorithm if the function calls are a major factor in performance.

    • Faresh@lemmy.ml
      link
      fedilink
      English
      arrow-up
      5
      arrow-down
      1
      ·
      10 months ago

      Recursion is never more efficient than the best equivalent iterative solution. Recursion however allows you to solve some problems very easily and very neatly.

    • jjagaimo@lemmy.ca
      link
      fedilink
      English
      arrow-up
      4
      ·
      edit-2
      10 months ago

      I’m exaggerating a bit there. This problem is fairly easy to implement iteratively (e.g. keep a list of unbrowsed folders and keep adding to it), but that is not the case for all problems. Some will be easier to solve in one way, though fundamentally solvable either way

    • coloredgrayscale@programming.dev
      link
      fedilink
      arrow-up
      2
      ·
      10 months ago

      A naive iterative implementation would be by adding and removing the folders/files from a list.

      If tail call optimization works on the (recursive) example then that’s (kinda) the compiler turning a recursive function into a loop.