[manu2011]

can you give me a non recursive version of quicksort that uses a stack. the version should store at the stack indicies[i,j] of subarrays that have not been sorted yet.
what is the number of [i,j] pairs, non-sorted subarrays that can belong to stack simultaneously.

[Alex81388]

That would be a long sort, thats why they use recursion.

[johng]

Hi, Virgin Techie,
I wrote a non-recursive quicksort as a part of a QB45 program in 1989 when I indexed the KJV of the Bible as I was tired of carrying around a Strong's Concordance when I went to a Thursday night Bible study group at a friend's house. Let me know if this would help you. The source code is easy to follow. It's not much longer than the recursive code, and it is faster.
John