DSA/linearQueue.cpp at master · Abdullahhas/DSA · 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
#include<iostream>
using namespace std;
struct linearQueue
{
    int queue[5];
    int front = -1;
    int rear = -1;

};
linearQueue q;

void insert(int size , int value)
{
    if(q.front == 0 && q.rear == size-1)
    {
        cout<<"Overflow";
        return;
    }
    else if(q.front == -1 && q.rear== -1)
    {
        q.front++;
        q.rear++;
        q.queue[q.rear] = value;
    }
    else{
        q.rear++;
        q.queue[q.rear] = value;
    }
}

int deletion()
{
    int tem;

    if(q.front==-1 && q.rear == -1)
    {
        cout<<"Underslow";
        return -1;
    }
    else if(q.front == q.rear)
    {
         tem = q.queue[q.front];
        q.front= -1;
        q.rear= -1;
        return tem;

    }
    else{
         tem = q.queue[q.front];
        q.front++;
        return tem;
    }
}

void display()
{
    for (int i = q.front; i <= q.rear; i++)
    {
        cout<<q.queue[i]<<endl;
    }

}

void question1()
{
int a ,b;
    insert(10,4);
    insert(10,2);
    for (int i = 0; i <= 10; i++)
    {
        a = deletion();
        b = deletion();
        insert(10,b);
        insert(10,a+b);
        cout<<a<<endl;
    }
}

int main()
{
    question1();


}