algo_029.md (337B)
1 # algo_029 2 3 ### Problem Statement 4 5 > Write an algorithm to pop a element from stack. 6 7 ## Algorithm 8 ``` 9 procedure pop(stack[], top, n) 10 begin 11 if(top = -1) 12 write("Stack is empty, deletion not possible."); 13 return; 14 else 15 x ← stack[top]; 16 top ← top - 1; 17 return x; 18 endif; 19 end procedure 20 ```