Make algorithm for this source code package arraystack; import java.util.Scanner; import java.util.Stack; class ArrayStack { public static void main(String[] args) { int type_of_op; Stack str=new Stack<>(); Scanner s = new Scanner(System.in); while(true) { System.out.println("*********Stack Menu*********\n"); System.out.println("Pick a number"); System.out.println("1. Push"); System.out.println("2. Pop"); System.out.println("3. Peek"); System.out.println("4. Exit"); System.out.println("\n Enter your choice \n"); type_of_op = s.nextInt(); switch (type_of_op) { case 1: System.out.println("Enter your element which you want to push"); str.push(s.next()); System.out.println("The Stack is: " + str); break; case 2: str.pop(); System.out.println("The Stack is: " + str); break; case 3: System.out.println("Topmost element is: " + str.peek()); System.out.println("The Stack is: " + str); break; case 4: System.out.println("Program Exiting...."); return; default: System.out.println("You have entered a wrong choice!"); return; } } } }
Make
package arraystack;
import java.util.Scanner;
import java.util.Stack;
class ArrayStack {
public static void main(String[] args) {
int type_of_op;
Stack<String> str=new Stack<>();
Scanner s = new Scanner(System.in);
while(true) { System.out.println("*********Stack Menu*********\n"); System.out.println("Pick a number");
System.out.println("1. Push");
System.out.println("2. Pop");
System.out.println("3. Peek");
System.out.println("4. Exit");
System.out.println("\n Enter your choice \n");
type_of_op = s.nextInt();
switch (type_of_op) {
case 1: System.out.println("Enter your element which you want to push");
str.push(s.next()); System.out.println("The Stack is: " + str);
break;
case 2: str.pop(); System.out.println("The Stack is: " + str);
break;
case 3: System.out.println("Topmost element is: " + str.peek());
System.out.println("The Stack is: " + str);
break;
case 4: System.out.println("
return; default: System.out.println("You have entered a wrong choice!");
return;
}
}
}
}
Step by step
Solved in 2 steps
