Quicksort: Iterative or Recursive

Question

I learnt about quick sort and how it can be implemented in both Recursive and Iterative method.
In Iterative method:

1. Push the range (0...n) into the stac

Answer 1

Recursion is NOT always slower than iteration. Quicksort is perfect example of it. The only way to do this in iterate way is create stack structure. So in other way do the same that the compiler do if we use recursion, and propably you will do this worse than compiler. Also there will be more jumps if you don't use recursion (to pop and push values to stack).