data-structure/dequeue.c at master · fuzaila/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
101
102
103
104
#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
#include"dequeue.h"
int front=-1, rear=-1;
int *queue;
int size;
void setsize(int a)
{
		size=a;
		queue=malloc(sizeof(size));
}
bool isempty()
{
		if(front==-1)
									return true;
		else
			return false;
}
bool isfull(int size)
{
	if((front==0 && rear==size-1)||front==rear+1)
					                                return true;
	else
		return false;
}
void insert_rear(int item)
{
    if(isfull(size))
	{
								printf("\nOverflow\n");
								return;
	}
	else if(rear==-1)
	{
				rear++;
				front++;
	}
	else if(rear==size-1 && front>0)
									rear=0;
	else
	{
		rear++;
		queue[rear]=item;
		printf("Inserted %d",item);
	}
}
void delete_front()
{
	if(isempty())
	{
					printf("Queue empty");
					return;
	}
	else
	{
		printf("%d deleted",queue[front]);
		front++;
	}
}
void insert_front(int item)
{
    if(isfull(size))
	{
								printf("\nOverflow\n");
								return;
	}
	else if(isempty())
	{
				rear=0;
				front=0;
	}
	else
	{
		if(front==0)
					front=size-1;
		else
			front=front-1;

	}
	queue[front]=item;
	printf("Inserted %d",item);
}
void delete_rear()
{
	if(isempty())
	{
					printf("Queue empty");
					return;
	}
	printf("%d deleted.\n",queue[rear]);
	if(front==rear)
	{
				front=-1;
				rear=-1;
	}
	else
	{
		if(rear==0)
					rear=size-1;
		else
				rear--;
	}
}