Stack implementation

package ds.Stack;

public class Runner {

public static void main(String[] args)
{
  Stack stack = new Stack();
  stack.push(10);
  //stack.push(20);
// stack.push(30);

  stack.show();
  int pop1 = stack.pop();
  System.out.println("");
  System.out.println("Popped: "+pop1);
  stack.show();
 
  int peek1 = stack.peek();
  System.out.println("");
  System.out.println("Peeked: "+peek1);
  stack.show();
 
  System.out.println("");
  int size = stack.size();
  System.out.println("Size is:"+size);
 
  System.out.println("");
  stack.isEmpty();
 

}

}

=====================================================================

package ds.Stack;

public class Stack 

{

int[] stack = new int[5];

int  top = 0;

public void push(int i) 

{

if(top==5)

{

System.out.println("Stack is full");

return;

}

else

{

stack[top] = i;

top++;

}

}

public void show() 

{

for(int n :stack)

System.out.print(n+" ");

}

public int pop() 

{

if(top<=0)

{

System.out.println("Stack is Empty");

return 0;

}

else

{

int data;

top--;

data  = stack[top];

stack[top]= 0;

return data;

}

}

public int  peek() 

{

if(top<=0)

{

System.out.println("Stack is Empty");

return 0;

}

else

{

int data;

data  = stack[top -1];

return data;

}

}

public int size() 

{

  return (top);

}

public void  isEmpty() 

{

  if(top<=0)

  System.out.println("Stack is Empty");

  

  else

  System.out.println("Stack is NOT Empty");

  

}

}

========================================================================