What is iterative quick sort?

Question

What are differences between quick sort and iterative quick sort?

Answer 1

Quick sort is most easily done recursively.

You pick a pivot point, and switch elements until everything on the left is smaller and everything on the right is bigger.

Then you take both sides and apply the same algorithm again, which means the function will call itself again recursively until the list is sorted.

An iterative version would try to accomplish that with loops and without recursion.

Answer 2

Thank you