A program is called recursive when an entity calls itself. A program is call iterative when there is a loop (or repetition).
Example: Program to find the factorial of a number
Factorial of 5 using Recursion is: 120 Factorial of 5 using Iteration is: 120
Below are the detailed example to illustrate the difference between the two:
- Time Complexity: Finding the Time complexity of Recursion is more difficult than that of Iteration.
- Recursion: Time complexity of recursion can be found by finding the value of the nth recursive call in terms of the previous calls. Thus, finding the destination case in terms of the base case, and solving in terms of the base case gives us an idea of the time complexity of recursive equations. Please see Solving Recurrences for more details.
- Iteration: Time complexity of iteration can be found by finding the number of cycles being repeated inside the loop.
- Usage: Usage of either of these techniques is a trade-off between time complexity and size of code. If time complexity is the point of focus, and number of recursive calls would be large, it is better to use iteration. However, if time complexity is not an issue and shortness of code is, recursion would be the way to go.
- Recursion: Recursion involves calling the same function again, and hence, has a very small length of code. However, as we saw in the analysis, the time complexity of recursion can get to be exponential when there are a considerable number of recursive calls. Hence, usage of recursion is advantageous in shorter code, but higher time complexity.
- Iteration: Iteration is repetition of a block of code. This involves a larger size of code, but the time complexity is generally lesser than it is for recursion.
- Overhead: Recursion has a large amount of Overhead as compared to Iteration.
- Recursion: Recursion has the overhead of repeated function calls, that is due to repetitive calling of the same function, the time complexity of the code increases manifold.
- Iteration: Iteration does not involve any such overhead.
- Infinite Repetition: Infinite Repetition in recursion can lead to CPU crash but in iteration, it will stop when memory is exhausted.
- Recursion: In Recursion, Infinite recursive calls may occur due to some mistake in specifying the base condition, which on never becoming false, keeps calling the function, which may lead to system CPU crash.
- Iteration: Infinite iteration due to mistake in iterator assignment or increment, or in the terminating condition, will lead to infinite loops, which may or may not lead to system errors, but will surely stop program execution any further.
|Definition||Function calls itself.||A set of instructions repeatedly executed.|
|Application||For functions.||For loops.|
|Termination||Through base case, where there will be no function call.||When the termination condition for the iterator ceases to be satisfied.|
|Usage||Used when code size needs to be small, and time complexity is not an issue.||Used when time complexity needs to be balanced against an expanded code size.|
|Code Size||Smaller code size||Larger Code Size.|
|Time Complexity||Very high(generally exponential) time complexity.||Relatively lower time complexity(generally polynomial-logarithmic).|
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Determine the first and last iteration in a foreach loop in PHP?
- Decimal to Binary using recursion and without using power operator
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Tail Recursion
- Algorithms | Recursion | Question 9
- Algorithms | Recursion | Question 2
- Algorithms | Recursion | Question 3
- Algorithms | Recursion | Question 4
- Algorithms | Recursion | Question 5
- Algorithms | Recursion | Question 6
- Algorithms | Recursion | Question 7
- Algorithms | Recursion | Question 8
- Algorithms | Recursion | Question 9
- Print numbers 1 to N using Indirect recursion
- Reversing a queue using recursion
- Time Complexity Analysis | Tower Of Hanoi (Recursion)
- Generating subarrays using recursion
- Product of 2 numbers using recursion | Set 2
- Zig-Zag traversal of a Binary Tree using Recursion
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.