Design patterns for converting recursive algorithms to iterative ones

by

You can often entirely preserve the original structure of a recursive algorithm, but avoid the stack, by employing tail calls and changing to continuation-passing, as suggested by this blog entry. (I should really cook up a better standalone example.)

More Related Contents:

  1. recursion versus iteration
  2. Quicksort: Iterative or Recursive
  3. Algorithm for iterating over an outward spiral on a discrete 2D grid from the origin
  4. Solve T(n)=T(n-1)+2n by backwards iteration method
  5. What is tail recursion?
  6. What is tail call optimization?
  7. Understanding recursion [closed]
  8. Is log(n!) = Θ(n·log(n))?
  9. How to find all combinations of coins when given some dollar value [closed]
  10. Breadth First Vs Depth First
  11. Time complexity of Euclid’s Algorithm
  12. find all subsets that sum to a particular value
  13. SICP example: Counting change, cannot understand
  14. How can I compute a Cartesian product iteratively?
  15. Why is the complexity of computing the Fibonacci series 2^n and not n^2?
  16. Travelling Salesman with multiple salesmen?
  17. Basic Recursion, Check Balanced Parenthesis
  18. Finding height in Binary Search Tree
  19. Why is my recursive function so slow in R?
  20. Convert recursion to tail recursion
  21. Memory efficient power set algorithm
  22. Efficiency of purely functional programming
  23. Getting the submatrix with maximum sum?
  24. What is a bubble sort good for? [closed]
  25. Hashing a Tree Structure
  26. Quicksort superiority over Heap Sort
  27. Best way of calculating n choose k?
  28. Finding multiple entries with binary search
  29. Given a number, find the next higher number which has the exact same set of digits as the original number
  30. Algorithm for permutations of operators and operands

Leave a Comment