只使用栈操作的排序

只使用栈操作的排序

Write a C program to sort a stack in ascending order. You should not
make any assumptions about how the stack is implemented. The following
are the only
functions that should be used to write this program:
Push | Pop | Top | IsEmpty | IsFull

解答：
 The algorithm is O(N^2) and appears below.

void sort_stack(Stack * src, Stack * dest)
{
    while (!src->IsEmpty())
   {
       Int tmp = src->Pop();
       while(!dest->IsEmpty() && dest->Top() > tmp)
       {
          src->Push(dest->Pop());
       }
       dest->Push(tmp);
   }


}