A stack data-structure implementation written in python.
- Basic stack operations
- push() - add an element to the top of the stack;
- pop() - remove an element from the top of the stack;
- peek() - get the element at the top of the stack;
- isfull() - Check if the stack is full;
- isempty() - Check if the stack is empty;
- reverse() - reverses the stack elements's order;
- sort() - sorts the stack (lesser elements at the top and greater ones at the bottom);
- top_to_bottom() - sends the top element of the stack to the bottom.