Advertisement
S_h_u_v_r_o

Stack

Mar 23rd, 2019
175
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.68 KB | None | 0 0
  1. #include<stdio.h>
  2.  
  3. int top=-1,ms=6,stack[6];
  4.  
  5. void push(int a)
  6. {
  7. if(top==ms-1)
  8. {
  9. printf("Stack is full\n");
  10. }
  11. else
  12. {
  13. top++;
  14. stack[top]=a;
  15. }
  16. }
  17.  
  18. void pop()
  19. {
  20. int a;
  21. if(top==-1)
  22. {
  23. printf("Stack is empty\n");
  24. }
  25. else
  26. {
  27. a=stack[top];
  28. top--;
  29.  
  30. }
  31. printf("%d ",a);
  32.  
  33. }
  34.  
  35. int main()
  36. {
  37. int a,b,c;
  38. printf("\t\t\tPUSH OPERATION\n");
  39. scanf("%d",&a);
  40. for(b=0; b<a; b++)
  41. {
  42. scanf("%d",&c);
  43. push(c);
  44. }
  45. printf("\t\tPOP OPERATION\n");
  46.  
  47. scanf("%d",&a);
  48. for(b=0; b<a; b++)
  49. {
  50. pop();
  51. }
  52.  
  53. return 0;
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement