Computer Forums - View Single Post - non-recursive quicksort

manu2011 · 03-18-2005, 07:05 PM

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.

03-18-2005, 07:05 PM	#1 (permalink)
manu2011 Newb Techie Join Date: Mar 2005 Posts: 3	non-recursive quicksort 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.