Recursion or Iteration?

Question

Is there a performance hit if we use loop instead of recursion or vice versa in algorithms where both can serve the same purpose? Eg : Check if given string is palindrome.I have seen many programmers using recursion as a means to show off when a simple iteration algorithm can fit the bill.Does the compiler play a vital role in deciding what to use?

Answer 1

Recursion puts a lot of pressure on the call stack.

Nevertheless, there are recursive algorithms like Quicksort that are quite fast

If not coded and implemented correctly, recursive algorithms with poor or

insufficient stopping conditions can easily blow up the call stack.

Yes, in your paindrome example, recursion does seem a bit overkill.

But other algorithms like quickSort, Binary Search, Merge Sort, and

games involving AI, like chess or checkers, recursion is the tool of choice.

It is the problem, rather than the compiler, that drives the design.