DS-Assignment/queue.cpp at master · geeky1Coder/DS-Assignment · 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
105
106
107
108
109
110
111
112
113
114
115
#define MAX_SIZE 5
#include <bits/stdc++.h>
using namespace std;
class My_queue
{
    int front;
    int rear;
    int size;
    int *queue_arr;

public:
    My_queue() : front{-1}, rear{-1}, size{0}
    {
        queue_arr = new int[MAX_SIZE];
    }
    ~My_queue()
    {
        delete[] queue_arr;
    }
    void enque(int element)
    {
        if ((front == 0 && rear == MAX_SIZE - 1) || (rear == front - 1 % (MAX_SIZE - 1)))
        {
            cout << "Queue is full";
            return;
        }
        else if (front == -1)
        {
            front = rear = 0;
            queue_arr[rear] = element;
            ++size;
        }
        else if (rear == MAX_SIZE - 1 && front != 0)
        {
            rear = 0;
            queue_arr[rear] = element;
            ++size;
        }
        else
        {
            rear++;
            queue_arr[rear] = element;
            size++;
        }
    }
    int deque()
    {
        if (front == -1)
        {
            cout << "queue is empty" << endl;
            return INT_MIN;
        }
        int data = queue_arr[front];
        queue_arr[front] = -1;
        if (front == rear)
        {
            front = -1;
            rear = -1;
            size--;
        }
        else if (front == MAX_SIZE - 1)
        {
            front = 0;
            size--;
        }
        else
        {
            front++;
            size--;
        }
        return data;
    }
    void display()
    {
        if (front == -1)
        {
            cout << "Queue is empty";
        }
        else if (front <= rear)
        {
            for (int i = front; i <= rear; ++i)
            {
                cout << queue_arr[i] << " ";
            }
        }
        else
        {
            for (int i = front; i != MAX_SIZE; ++i)
            {
                cout << queue_arr[i] << " ";
            }
            for (int i = 0; i <= rear; ++i)
            {
                cout << queue_arr[i] << " ";
            }
        }
        cout << endl;
    }
};

int main()
{
    My_queue q{};
    q.enque(50);
    q.enque(70);
    q.enque(80);
    q.enque(40);
    q.enque(70);
    q.deque();
    q.deque();
    q.deque();
    q.enque(10);
    q.display();
    return 0;
}