Assign5 Stack Array
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View Assign5 Stack Array as PDF for free.
More details
- Words: 823
- Pages: 7
/* peep operation on the stack using arrays */ # include<stdio.h> # include<string.h> # include # define size 100 int top = -1; int flag = 0; int stack[100]; int data; void push(int *, int); int peep(int *); void display(int *); /* definition of the push function */ void push(int s[], int d) { if(top ==(size-1)) flag = 0; else { flag = 1; ++top; s[top] = d; } } /* definition of the peep function */ int peep(int s[]) { int i; int peeped_element; printf("\n input the information number to which you want access:"); scanf("%d", &i); if(top - i + 1 < 0) { peeped_element = 0; flag = 0; } else { flag = 1; peeped_element = s[top-i +1]; } return (peeped_element); }
/* definition of the display function */ void display(int s[]) { int i; if(top == -1) { printf("stack is empty"); } else { for(i = top; i>=0; --i) printf(" %d ", s[i]); } } /* function main */ void main() { int data; char choice; int q = 0; int top = -1; do { printf(" \npush->i peep->p quit->q:"); printf("\ninput the choice : "); do { choice = getchar(); choice =tolower(choice); }while(strchr("ipq",choice)==null); printf("your choice is: ", choice); switch(choice) { case 'i' : printf("\n input the element to push:"); scanf("%d", &data); push(stack, data); if(flag) { printf("\n after inserting "); display(stack); if(top == (size-1)) printf("\n stack is full"); } else printf("\n stack overflow after pushing"); break; case 'p' : data = peep(stack); if(flag) {
printf("\n data is peeped: %d", data); printf("\n stack is as follows:\n"); display(stack); } else printf("\n stack underflow"); break; case 'q': q = 1; } } while(!q); } /* implementation of the stack using arrays */ # include<stdio.h> # include<string.h> # include # define size 100 int top = -1; int flag = 0; int stack[size]; void push(int *, int); int pop(int *); void display(int *); /* definition of the push function */ void push(int s[], int d) { if(top ==(size-1)) flag = 0; else { flag = 1; ++top; s[top] = d; } } /* definition of the pop function */ int pop(int s[]) { int popped_element; if(top == -1) { popped_element = 0; flag = 0;
} else { flag = 1; popped_element = s[top]; --top; } return (popped_element); } /* definition of the display function */ void display(int s[]) { int i; if(top == -1) { printf("\n stack is empty"); } else { for(i = top; i >= 0; --i) printf("\n %d", s[i] ); } } /* function main */ void main() { int data; char choice; int q = 0; int top = -1; do { printf(" \npush->i pop->p quit->q:"); printf("\ninput the choice : "); do { choice = getchar(); choice =tolower(choice); }while(strchr("ipq",choice)==null); printf("your choice is: %c",choice); switch(choice) { case 'i' : printf("\n input the element to push:"); scanf("%d", &data); push(stack, data); if(flag) { printf("\n after inserting ");
display(stack); if(top == (size-1)) printf("\n stack is full"); } else printf("\n stack overflow after pushing"); break; case 'p' : data = pop(stack); if(flag) { printf("\n data is popped: %d", data); printf("\n rest data in stack is as follows:\n"); display(stack); } else printf("\n stack underflow" ); break; case 'q': q = 1; } } while(!q); } /* updating a stack implemented with the help of arrays.*/ # include<stdio.h> # include<string.h> # include # define size 100 int top = -1; int flag = 0; int stack[100]; int data; void push (int *, int); int update (int *); void display (int *); /* definition of the push function */ void push(int s[], int d) { if(top ==(size-1)) flag = 0; else { flag = 1; ++top;
s[top] = d; } } /* definition of the pop function */ int update(int s[]) { int i; int update_element; printf("\n input the information number to which you want to update: "); scanf("%d", &i); if(top - i + 1 < 0) { update_element = 0; flag = 0; } else { flag = 1; update_element = s[top-i +1]; printf("\n input the new value: "); scanf("%d", &s[top-i+1]); } return (update_element); } /* definition of the display function */ void display(int s[]) { int i; if(top == -1) { printf("stack is empty"); } else { for(i = top; i>=0; --i) printf(" %d", s[i]); } } void main() { int stack[size]; int data; char choice; int q = 0; int top = -1; do { printf(" \npush->i update->u quit->q: ");
printf("\ninput the choice : "); do { fflush(stdin); choice = getchar(); choice = tolower(choice); }while(strchr("iuq",choice)==null); printf("your choice is -> %c", choice); switch(choice) { case 'i' : printf("\n input the element to pushed: "); scanf("%d", &data); push(stack, data); if(flag) { printf("\n after inserting "); display(stack); if(top == (size-1)) printf("\n stack is full"); } else printf("\n stack overflow after pushing"); break; case 'u' : data = update(stack); if(flag) { printf("\n data is peepped: %d", data); printf("\n stack is as follows:\n"); display(stack); } else printf("\n stack underflow"); break; case 'q': q = 1; } } while(!q); }
/* definition of the display function */ void display(int s[]) { int i; if(top == -1) { printf("stack is empty"); } else { for(i = top; i>=0; --i) printf(" %d ", s[i]); } } /* function main */ void main() { int data; char choice; int q = 0; int top = -1; do { printf(" \npush->i peep->p quit->q:"); printf("\ninput the choice : "); do { choice = getchar(); choice =tolower(choice); }while(strchr("ipq",choice)==null); printf("your choice is: ", choice); switch(choice) { case 'i' : printf("\n input the element to push:"); scanf("%d", &data); push(stack, data); if(flag) { printf("\n after inserting "); display(stack); if(top == (size-1)) printf("\n stack is full"); } else printf("\n stack overflow after pushing"); break; case 'p' : data = peep(stack); if(flag) {
printf("\n data is peeped: %d", data); printf("\n stack is as follows:\n"); display(stack); } else printf("\n stack underflow"); break; case 'q': q = 1; } } while(!q); } /* implementation of the stack using arrays */ # include<stdio.h> # include<string.h> # include
} else { flag = 1; popped_element = s[top]; --top; } return (popped_element); } /* definition of the display function */ void display(int s[]) { int i; if(top == -1) { printf("\n stack is empty"); } else { for(i = top; i >= 0; --i) printf("\n %d", s[i] ); } } /* function main */ void main() { int data; char choice; int q = 0; int top = -1; do { printf(" \npush->i pop->p quit->q:"); printf("\ninput the choice : "); do { choice = getchar(); choice =tolower(choice); }while(strchr("ipq",choice)==null); printf("your choice is: %c",choice); switch(choice) { case 'i' : printf("\n input the element to push:"); scanf("%d", &data); push(stack, data); if(flag) { printf("\n after inserting ");
display(stack); if(top == (size-1)) printf("\n stack is full"); } else printf("\n stack overflow after pushing"); break; case 'p' : data = pop(stack); if(flag) { printf("\n data is popped: %d", data); printf("\n rest data in stack is as follows:\n"); display(stack); } else printf("\n stack underflow" ); break; case 'q': q = 1; } } while(!q); } /* updating a stack implemented with the help of arrays.*/ # include<stdio.h> # include<string.h> # include
s[top] = d; } } /* definition of the pop function */ int update(int s[]) { int i; int update_element; printf("\n input the information number to which you want to update: "); scanf("%d", &i); if(top - i + 1 < 0) { update_element = 0; flag = 0; } else { flag = 1; update_element = s[top-i +1]; printf("\n input the new value: "); scanf("%d", &s[top-i+1]); } return (update_element); } /* definition of the display function */ void display(int s[]) { int i; if(top == -1) { printf("stack is empty"); } else { for(i = top; i>=0; --i) printf(" %d", s[i]); } } void main() { int stack[size]; int data; char choice; int q = 0; int top = -1; do { printf(" \npush->i update->u quit->q: ");
printf("\ninput the choice : "); do { fflush(stdin); choice = getchar(); choice = tolower(choice); }while(strchr("iuq",choice)==null); printf("your choice is -> %c", choice); switch(choice) { case 'i' : printf("\n input the element to pushed: "); scanf("%d", &data); push(stack, data); if(flag) { printf("\n after inserting "); display(stack); if(top == (size-1)) printf("\n stack is full"); } else printf("\n stack overflow after pushing"); break; case 'u' : data = update(stack); if(flag) { printf("\n data is peepped: %d", data); printf("\n stack is as follows:\n"); display(stack); } else printf("\n stack underflow"); break; case 'q': q = 1; } } while(!q); }
Related Documents
Assign5 Stack Array
November 2019 6
Stack Array
May 2020 6
Assign5 Stack Linklist
November 2019 8
Ex12 Stack Array Bp
October 2019 8
Pointer Array Heap Stack In C Programming
June 2020 5