s3lp/cqueue.c at master · Datron/s3lp · 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
#include<stdio.h>
#define MAX 4
void enqueue(char[],int *,int *,char);
char dequeue(char[],int *,int *);
void display(char[],int,int);
void main()
{
	char q[MAX];
	char e,temp;
	int choice, done,i;
	int f,r;
	f=r=0;
	done=0;
	while(!done)
	{
		printf("1.Insert 2.Delete 3.Display 4.Exit \n");
		printf("Enter choice \n");
		scanf("%d",&choice);
		switch(choice)
		{
			case 1:
			printf("Enter elements \n");
			scanf(" %c",&e);
			enqueue(q,&f,&r,e);
			break;

			case 2:
			temp=dequeue(q,&f,&r);
			if(temp == '#')
				printf("Queue underflow \n");
			else
				printf("Queue elements deleted are %c \n",temp);
			break;

			case 3:
			display(q,f,r);
			break;
			case 4:
			done = 1;
			break;
			default:
			printf("Illegal operation \n");
			break;
		}
	}
}
void enqueue(char q[],int *f,int *r,char e)
{
	if(*f ==((*r+1)%MAX))
		printf("Queue Overflow \n");
	else {
	*r = (*r+1)%MAX;
	q[*r]=e;
	}
}
char dequeue(char q[],int *f,int *r)
{
	char x;
	if(*f == *r)
		return '#';
	else {
	*f = (*f+1)%MAX;
	x = q[*f];
	}
	return x;
}
void display(char q[],int f,int r)
{
	int i=f;
	if(f==r)
		printf("Queue Overflow \n");
	else {
	while(i!=r)
	{
		i = (i+1)%MAX;
		printf("%c \t",q[i]);
	}
	printf("\n");
}
}