We have worked with iteration in previous lectures, related to loops, while recursion is a new topic for us. Let's start with the definition:
"Recursion occurs when a function calls itself."
Mostly both recursion and iteration are used in association with loops, but both are very different from each other. In both recursion and iteration, the goal is to execute a statement again and again until a specific condition is fulfilled. An iterative loop ends when it has reached the end of its sequence; for example, if we are moving through a list, then the loop will stop executing when it reached the end of the list. But in the case of recursion, the function stops terminating when a base condition is satisfied. Let us understand both of them in detail.
There are two essential and significant parts of a recursive function. The first one is the base case, and the second one is the recursive case. In the base case, a conditional statement is written, which the program executes at the end, just before returning values to the users. In the recursive case, the formula or logic the function is based upon is written. A recursive function terminates to get closer to its base case or base condition. As in case of loops, if the condition does not satisfy the loop could run endlessly, the same is in recursion that if the base case is not met in the call, the function will repeatedly run, causing the system to crash.
In case of recursion, each recursive call is stored into a stack until it reaches the base condition, then the stack will one by one return the calls printing a series or sequence of numbers onto the screen. It is worth noting that stack is a LIFO data structure i.e., last in first out. This means that the call that is sent into the stack at the end will be executed first, and the first one that was inserted into the stack will be executed at last.
We have a basic idea about iteration as we have already discussed it in tutorial # 16 and 17 relating loops. Iteration runs a block of code again and again, depending on a user-defined condition. Many of the functions that recursion performs can also be achieved by using iterations but not all, and vice versa.
In my opinion for smaller programs where there are lessor lines of codes, we should use a recursive approach and in complex programs, we should go with iteration to reduce the risk of bugs.
# n! = n * n-1 * n-2 * n-3.......1 # n! = n * (n-1)! def factorial_iterative(n): """ :param n: Integer :return: n * n-1 * n-2 * n-3.......1 """ fac = 1 for i in range(n): fac = fac * (i+1) return fac def factorial_recursive(n): """ :param n: Integer :return: n * n-1 * n-2 * n-3.......1 """ if n ==1: return 1 else: return n * factorial_recursive(n-1) # 5 * factorial_recursive(4) # 5 * 4 * factorial_recursive(3) # 5 * 4 * 3 * factorial_recursive(2) # 5 * 4 * 3 * 2 * factorial_recursive(1) # 5 * 4 * 3 * 2 * 1 = 120 # 0 1 1 2 3 5 8 13 def fibonacci(n): if n==1: return 0 elif n==2: return 1 else: return fibonacci(n-1)+ fibonacci(n-2) number = int(input("Enter then number")) # print("Factorial Using Iterative Method", factorial_iterative(number)) # print("Factorial Using Recursive Method", factorial_recursive(number)) print(fibonacci(number))
I want discription
bhai n term ka fiboibonacci list print karna hoto kya kare...............
No downloadable resources for this video. If you think you need anything, please post it in the QnA!
Any Course related announcements will be posted here