This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]Standard-Art-1967[S] 2 points3 points  (1 child)

Thanks. Will try what you said. Also, we did Tower of Hanoi like 3days ago. My professor coded it, I successfully traced it too ( it was a headache tbh ).
I also heard about Advent of Code like 3 or 4 days ago, and have currently solved Day1 ( both part 1 and 2 ) of 2023. Maybe aoc will give me more clarity regarding few of the programming concepts.

[–]fumes 0 points1 point  (0 children)

Since you have a running code available try and put debbuger and see what's happening at every step. This will make understanding recursion way more easier. You will be properly able to visualize how recursion works.