Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- using namespace std;
- int stack[10];
- int k=-1;
- void push(int n){
- k++;
- stack[k]=n;
- }
- int pop(){
- return stack[k--];
- }
- isEmpty(){
- if(k==-1)
- printf("Empty");
- else
- printf("Not Empty");
- }
- int main(){
- push(20);
- push(10);
- push(42);
- pop();
- pop();
- pop();
- isEmpty();
- return 0;
- }
Add Comment
Please, Sign In to add comment