Replies to message #10,130

You just return out of the function when some condition is met instead of calling the function again.

Go grind DFS problems on leetcode. Edit: Generally you want to start with conditions that end function. I.e for Fibonacci: f 0 = 0 f 1 = 1 f n =...

i mean as far as i know the current cpu architecture is pretty unfriendly to recursive functions uhh find a condition when the function should...

Do SICP and it will become more intuitive than loops. After i done so and gotten fully into LISP it clicked for me and now i cannot stand loops...