Sort the stack in ascending order
Sort the given stack into an ascending order without using recursion.
- Pop an item from the original stack and push it onto the sorted stack.
- If the poped item from the original stack < the top item in the sorted stack then
- pop the item from the sorted stack and push it onto the original stack until the sorting order is satisfied.
This post is a follow-up of
I recommend reading it first, as the following code uses the methods from it.