Iterative quicksort (no recursion)
After partitioning the array, it looks like:
There are now two sections to sort, b[h..j-1] and b[j+1..k], and while one is being sorted, it must be remembered to sort the other.
Sorting b[h..j-1] will result in partitioning and the creation of two other sections to sort; these must also be �remembered�.