Alphabetizing stacks

[Jason Tanner]

  I have been faced with an interesting dilema. in a program I am writing I need to alphabetize a Stack (of any length). The alphabetizing will occur after the stack is ientered (push) and before I start removing things from it (pop).
The only pointers in the stack are ptrtop (top of stack) and ptrnext(used to point to each members next member) and ptrnew but this is used just for pushing on
new members of the stack.  Any ideas on aplhabetizing stacks please post here.
If anyone has actuall example sourc-code of this please send it via private mail

   Thank you!
-- 
|----------------------------------------------------------------------------|
| jtanner at jack.sns.com   -  -   Coke IS it! - -  Ask me, I don't work here   |
|                This space was intentionally  left filled.                  |
|------------------------------Dare to think!--------------------------------|