Workspace/circularQueue.cpp at master · afAditya/Workspace · 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
// Circular Queue with Array using C++

#include<iostream>
#include<cstdio>

#define SIZE 5
using namespace std;

int front = -1, rear =-1;
int arr[SIZE];
int isFull()
{
    if( (front == rear + 1) || (front == 0 && rear == SIZE-1))
    { return 1; }
    else {
    return 0; }
}

int isEmpty()
{
    if(front == -1)
    { return 1; }
    else {
    return 0; }
}

void insertE(int element)
{
    if(isFull())
    { cout<<"\n Overflow : Queue is full "; }
    else
    {
        if(front == -1) front = 0;
        rear = (rear + 1) % SIZE;
        arr[rear] = element;
        cout<<"\n Inserted  "<<element;
    }
}


int deQueue()
{
    int element;
    if(isEmpty()) {
        cout<<"\n Underflow : Queue is empty \n";
        return(-1);
    } else {
        element = arr[front];
        if (front == rear){
            front = -1;
            rear = -1;
        }
        else {
            front = (front + 1) % SIZE;

        }
        printf("\n Deleted element = %d \n", element);
        return element ;
    }
}


void display()
{
 int i;
    if(isEmpty())
        {  cout<<" \n Empty Queue\n"; }
    else
    {
        printf("\n Front = %d ",front);
        printf("\n Items = ");
        for(  i = front; i!=rear; i=(i+1)%SIZE) {
            printf("%d ",arr[i]);
        }
        printf("%d ",arr[i]);
        printf("\n Rear = %d \n",rear);
    }
}

int main()
{
    deQueue();

    insertE(13);
    insertE(12);
    insertE(43);
    insertE(47);
    insertE(55);

    insertE(6);

    display();
    deQueue();

    display();

    insertE(7);
    display();

    insertE(8);
}