-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinear_queue_struct.c
More file actions
112 lines (95 loc) · 2.02 KB
/
linear_queue_struct.c
File metadata and controls
112 lines (95 loc) · 2.02 KB
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
//linear queue array of structure implementation
#include <stdio.h>
#include <stdlib.h>
#define size 5
typedef struct myShop
{
char name[15];
float price;
int quantity;
} shop;
int ele, front = -1, rear = -1;
shop del, myQueue[5];
void enqueue()
{
shop ele;
if(rear == size-1)
{
printf("Queue is full\n");
}
else
{
if(front == -1)
{
front = 0;
}
printf("Enter item name : ");
scanf("%s", ele.name);
printf("Enter item price : ");
scanf("%f", &ele.price);
printf("Enter item quantity : ");
scanf("%d", &ele.quantity);
myQueue[++rear] = ele;
}
}
void dequeue()
{
if((front == -1) || (front > rear))
{
printf("Queue empty! canot dequeue\n");
}
else
{
del = myQueue[front++];
printf("Element deleted from queue is %s, %f, %d\n", del.name, del.price, del.quantity);
if(front == rear+1)
{
front = -1;
rear =-1;
}
}
}
void display()
{
if((front == -1) || (front > rear))
{
printf("Queue empty! canot display\n");
}
else
{
printf("Displaying Queue Elements : \n");
for(int i = front; i<=rear; i++)
{
printf("%s ,%f, %d\n",myQueue[i].name, myQueue[i].price, myQueue[i].quantity);
}
}
}
int main()
{
int choice, del;
for(;;)
{
printf("Enter choice :\n");
printf("1. Enqueue\n");
printf("2. Dequeue\n");
printf("3. Display\n");
printf("4. Exit\n");
scanf("%d",&choice);
switch(choice)
{
case 1 :
enqueue();
break;
case 2 :
dequeue();
break;
case 3 :
display();
break;
case 4 :
exit(0);
default :
printf("Invalid choice\n");
}
}
}