Data_Structure/linear_queue_operation_using_array.c at main · makarandhinge/Data_Structure · GitHub

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
#include<stdio.h>
#include<stdlib.h>
#define max 5
void ins();
void del();
void exitt();
void traverse();
int rear=-1;
int front=-1;
int queue[max];
void main()
{
	int choice, c;

	do
	{
		printf("\n\t 1.Insert\n\t 2.Delete\n\t 3.Traverse\n\t 4.Exit\n");
		printf("\n Enter your choice:\t");
		scanf("%d", &choice);
switch(choice)
		{
			case 1:
				ins();
				break;
			case 2:
				del();
				break;
			case 3:
				traverse();
				break;
			case 4:
				exitt();
				break;
			defalut:
				printf("\nWrong choice");
				break;
		}
		printf("\n Wanna continue: (press 0 to exit)\t");
		scanf("%i", &c);
	}
	while(c!=0);
}
void ins()
{
	int item;
	if(rear==max-1)
	{
		printf("\n\tQueue Overflow\n");
	}
	else
	{
		printf("\n Enter queue element:\t");
		scanf("%d", &item);

		if(front==-1)
		{
			front=rear=0;
			queue[rear]=item;
		}
		else
		{
			rear=rear+1;
			queue[rear]=item;
		}
	}
}
void del()
{
	int item;
	if(front==-1 || front>rear)
	{
		printf("\n\tQueue Underflow\n");
	}
	else
	{
		item=queue[front];
		front=front+1;
		printf("\n %d item deleted\n", item);
	}
}
void exitt()
{
	exit(0);
}
void traverse()
{
	int i;
	if(rear==-1 || front>rear)
	{
		printf("\n\tQueue Underflow\n");
	}
	else
	{
		printf("\n\tQueue elements are:");
		for(i=front; i<=rear; i++)
			{
				printf("\t%d", queue[i]);
			}
	}
}