-
Notifications
You must be signed in to change notification settings - Fork 6
/
STACKARR.C
76 lines (70 loc) · 1.02 KB
/
STACKARR.C
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include<stdio.h>
#include<conio.h>
#define LENGTH 5
int stack[LENGTH];
int top=0;
void push(int);
void pop();
void list();
void main()
{
int ch,n;
do
{
clrscr();
printf("\n\tSTACK OPERATIONS\n");
printf("\n\t\t1.PUSH");
printf("\n\t\t2.POP");
printf("\n\t\t3.LIST");
printf("\n\t\t4.EXIT");
printf("\n\n\tEnter your choice(1-4) : ");
scanf("%d",&ch);
switch(ch)
{
case 1:
printf("\nEnter the element : ");
scanf("%d",&n);
push(n);
break;
case 2:
pop();
break;
case 3:
list();
break;
default:continue;
}
getch();
}while(ch!=4);
}
void push(int x)
{
if(top==LENGTH)
{
printf("\nSorry, stack is full...");
return;
}
stack[top++]=x;
printf("\n%d is added...",x);
}
void pop()
{
if(top==0)
{
printf("\nSorry, stack is empty...");
return;
}
printf("\n%d is removed...",stack[--top]);
}
void list()
{
int i;
if(top==0)
{
printf("\nSorry, stack is empty...");
return;
}
printf("\nThe stack :\n");
for(i=top-1;i>=0;i--)
printf("\n%d",stack[i]);
}