-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain (20).c
77 lines (70 loc) · 1.82 KB
/
main (20).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
/******************************************************************************
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 size 5
int queue[size];
int rear = -1 , front = -1;
int enqueue(int data);
int dequeue();
int display();
int main() {
int queue[size];
while(1){
int ch;
printf("------------Operation of Queue--------------\n");
printf("1. Enqueue\n");
printf("2. Dequeue\n");
printf("3. Display\n");
printf("4. Exit\n");
printf("Enter Your Choice : ");
scanf("%d" , &ch);
switch(ch){
int data;
case 1: printf("Enter a number : ");
scanf("%d" , &data);
enqueue(data);
break;
case 2:dequeue();
break;
case 3: display();
break;
case 4: exit(0);
break;
default: printf("Invalid Choice!");
}
}
return 0;
}
int enqueue(int data){
if(rear == size - 1){
printf("Queue is Full!\n");
}
if(rear == -1 && front == -1){
rear = 0 , front = 0;
queue[rear] = data;
} else {
rear++;
queue[rear] = data;
}
}
int dequeue(){
if(front == -1 && rear == -1){
printf("Queue is Empty");
} if(front == rear ){
front = -1 , rear = -1;
} else {
int item;
item = queue[front];
printf("%d\n" , item);
front++;
}
}
int display(){
for(int i = front; i <= rear ; i++){
printf("%d\t" , queue[i]);
}printf("\n");
}