jakepaul
Reputation: 1
Do recursive and iterative solutions to a problem have same worst time complexity?
If there is a theory existing that proves this, what is it to prove that both would give the same worst case time complexity? It has been showed that both can provide solutions to a problem, but nothing about both giving same worst case time complexity.
Upvotes: 0
Views: 63
Answers (1)
cgDude
Reputation: 93
It completely depends on the problem. But generally, recursive solutions can be made more time-efficient by using dynamic programming.
Upvotes: 2
Related Questions
- T(Running Time) vs T (Recursion)
- Do iterative and recursive versions of an algorithm have the same time complexity?
- Time complexity of algorithm with multiple recursion
- Time complexity on iterative and recursive solution
- Time complexity of recursive algorithm
- Time complexity of iterative and recursive algorithms
- Running time for recursive and iterative
- Is best Big O Time efficiency always the same as best Space efficiency for recursive solutions?
- Is there any time complexity difference between recursive and iterative approach?
- Recursive vs. Iterative algorithms