7. Basic Recursion

1. base case
2. condition to check in each iteration to quit early
3. return statement
------------------------------------------------------------------------------------------------------------
     Reversal of array-

-----------------------------------------------------------------------------------------------------------------------------
      Palindrome string check-

-----------------------------------------------------------------------------------------------------------------------------
                                                                        Fibonacci
time complexity: O(2^n):- exponential
---------------------------------------------------------------------------------------------------------------

Comments

Popular posts from this blog

30.) DP on subsequences

19. Strings (LB)

32. Binary Trees-2 (bfs/dfs med problems)