title: Sorting a stack in ascending order? (using only 3 stacks)
body: <p>So I'm doing some homework for CompSci 2 and the assignment requires us to sort a single stack (of five numbers) in ascending order using <strong>only</strong> 3 stacks - much like a Tower of Hanoi problem - but there are no rules on whether a larger can be placed on a smaller number, etc.</p>
  
  <p>I'm essentially trying to figure out a process on how to sort any number against another in the stack, but I'm at a bit of a loss - in trying to formulate an idea I came up with this: I could pop the top number off the stack, place it in another stack (say, stack 3), compare it to the next number in the original stack, and if it's less than it, I would put the number in stack 3 into stack 2.  But then I ran into the problem of order - if the number is less than the one after it, but <em>isn't</em> less than another number in the stack, my final result would be out of order.</p>
  
  <p>Could someone help me out here in figuring out method would work best?</p>