manu2010
Newbie level 3
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.
what is the number of [i,j] pairs, non-sorted subarrays that can belong to stack simultaneously.