Advertisement
asiffff

Stack

Feb 18th, 2019
229
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.13 KB | None | 0 0
  1. #include <stdio.h>
  2. #define max 10
  3. int a[100],n,f=0,x=0;
  4. void cre()
  5. {
  6. if(x==0)
  7. {
  8. int j;
  9. printf("\nEnter the value of Stack:\n");
  10. scanf("%d",&n);
  11. for(j=1;j<=n;j++)
  12. {
  13. a[j]==0;
  14. }
  15. x=1;
  16. }
  17. else
  18. {
  19. if(f==n)
  20. {
  21. printf("Stack is FULL:\n");
  22. }
  23. else
  24. {
  25. int i;
  26. printf("\nEnter the Stack data:\n");
  27. scanf("%d",&i);
  28. f++;
  29. a[f]=i;
  30. }
  31. }
  32. }
  33. void del()
  34. {
  35. if(f==0) printf("\nStack is Empty.\n");
  36. else
  37. {
  38. printf("\nDeleted data is %d",a[f]);
  39. a[f]=0;
  40. f--;
  41. }
  42. }
  43. void dis()
  44. {
  45. int i;
  46. for(i=n;i>=1;i--)
  47. {
  48. printf("%d ",a[i]);
  49. }
  50.  
  51. }
  52.  
  53. int main()
  54. {
  55. int x;
  56. while(1)
  57. {
  58. printf("\n1:Ins,2:Del,3: Dis:\n");
  59. scanf("%d",&x);
  60. switch(x)
  61. {
  62. case 1:
  63. {
  64. cre();
  65. break;
  66. }
  67. case 2:
  68. {
  69. del();
  70. break;
  71. }
  72. case 3:
  73. {
  74. dis();
  75. break;
  76. }
  77. }
  78. }
  79. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement