I need help implementing recursion in a general way
Help I realise you need to understand recursion to understand the rest of DSA like graphs etc but I'm not fully confident
So I know that recursion uses a base case and a recursive case but how can I come up with these on the spot like nothing because you can turn any for loop or while loop into a recursive function?
So I know that recursion uses a base case and a recursive case but how can I come up with these on the spot like nothing because you can turn any for loop or while loop into a recursive function?
