/**
 * Informatik II - FS2009 <br>
 * Uebungsserie 4, Aufgabe 4 <br>
 *
 * ...ADD YOUR COMMENTS HERE...
 */

public class Stack {

    private int stackArray[];
    private int sp; // stack pointer (pointer to the first "free" cell in stack; it is zero for an empty stack)

    /** Create a 100-elements stack array*/
    public Stack() {
        sp = 0;
        stackArray = new int[100];
    }

    /**
     * ...ADD YOUR COMMENTS HERE...
     *
     *@param maxSize ...ADD YOUR COMMENTS HERE...
     */
    public Stack(int maxSize) {
        sp = 0;
        stackArray = new int[maxSize];
    }

    /**
     * ...ADD YOUR COMMENTS HERE...
     */
    public void push(int element) {
        stackArray[sp++] = element;
    }

    /**
     * ...ADD YOUR COMMENTS HERE...
     */
    public int pop() {
        return stackArray[--sp];
    }

    /**
     * ...ADD YOUR COMMENTS HERE...
     */
    public int getTop() {
        return stackArray[sp-1];
    }

    /**
     * ...ADD YOUR COMMENTS HERE...
     */
    public boolean empty() {
        return sp == 0;
    }

    /**
     * ...ADD YOUR COMMENTS HERE...
     */
    public int getSP() {
        return sp;
    }

    /**
     * ...ADD YOUR COMMENTS HERE...
     */
    public void print() {
        for( int i = 0; i < sp; i++) {
            System.out.print( stackArray[i] + " ");
        }
        System.out.println();
    }
}