-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue menu.c
138 lines (122 loc) · 2.5 KB
/
queue menu.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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
/******************************************************************************
Online C Compiler.
Code, Compile, Run and Debug C program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include<stdio.h>
#include<stdlib.h>
#define MAX_SIZE 5
int queue[MAX_SIZE];
int front=-1;
int rear=-1;
int isempty()
{
return rear==-1;
}
int isfull()
{
return front==MAX_SIZE-1;
}
int front_value()
{
if(isempty())
{
printf("stack is empty\n");
}
else
{
return queue[front];
}
}
int enqueue(int value)
{
if(isfull())
{
printf("stack is full");
}
else
{
return queue[++rear]=value;
}
}
int dequeue()
{
if(isempty())
{
printf("stack is empty");
}
else
{
if(front==rear)
{
front=-1;
}
else
{
front++;
}
}
return queue[rear-1];
}
int display()
{
int i;
if(isempty())
{
printf("stack is empty\n");
}
for(i=front;i<rear;i++)
{
printf("%d\n",queue[i]);
}
}
int main()
{
/***
enqueue(10);
enqueue(20);
enqueue(30);
enqueue(40);
printf("after enqueue operation\n");
display();
printf("front_value=%d",front_value());
dequeue();
dequeue();
printf("\nafter dequeue operation\n");
display();
***/
int choice,value;
while(1)
{
printf("\n1.Push\n");
printf("2.Pop\n");
printf("3.Display the top element\n");
printf("4.Display all stack elements\n");
printf("5.Quit\n");
printf("\nEnter your choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1 :
printf("\nEnter the item to be pushed : ");
scanf("%d",&value);
enqueue(value);
break;
case 2:
value = dequeue();
printf("\ndequeue value is : %d\n",value );
break;
case 3:
printf("\nvalue at the top is : %d\n", front_value() );
break;
case 4:
display();
break;
case 5:
exit(0);
default:
printf("\nWrong choice\n");
}
}
return 0;
}