data_structure_and_algorithms/queue.cpp at main · centaurusgod/data_structure_and_algorithms · 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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include<iostream>
using namespace std;
struct arrayQueue{
int front, rear, *array, capacity;
};

struct arrayQueue *createQueue(int cap){
struct arrayQueue *q;
q=(struct arrayQueue*)malloc(sizeof(struct arrayQueue));
q->front=q->rear=-1;
q->capacity=cap;
q->array=(int*)malloc(sizeof(int)*cap);
if(!q->array){
    cout<<"Problem"<<endl;
    system("pause");
}
else{
    return q;
}
}

int isEmpty(struct arrayQueue *q){
    if(q->front==-1){
        return 1;
    }
    return 0;
}

int isFull(struct arrayQueue *q){
 if((q->rear+1)%q->capacity==q->front){
     return 1;
 }
 return 0;
}

int qSize(struct arrayQueue *q){
return(
(q->capacity-q->front+q->rear)%q->capacity
);
}

int enQueue(struct arrayQueue *q, int item){
if(!isFull(q)){
    q->rear=(q->rear+1)%q->capacity;
    q->array[q->rear]=item;
    if(q->front==-1){
        q->front=q->rear;
    }
}
else{
    cout<<"No more space"<<endl;
    system("pause");
}

}

int deQueue(struct arrayQueue *q){
    int item;
if(!isEmpty(q)){
item=q->array[q->front];
if(q->front==q->rear){
    q->front=q->rear=-1;
}
else{
    q->front=(q->front+1)%q->capacity;
}

}
else{
    cout<<"queue is empty"<<endl;
    system("pause");
    return -1;
}
return item;
}

void deleteQueue(struct arrayQueue *q){
if(q){
    if(q->array){
        free(q->array);
    }
    free(q);
    cout<<"Queue deleted sucessfully"<<endl;
    system("pause");
}

}


int main(){
struct arrayQueue *q;
q=createQueue(5);
int temp, item;
while(1){
    system("cls");
cout<<"1. Enqueue"<<endl;
cout<<"2. Dnqueue"<<endl;
cout<<"3. Squeue"<<endl;
cout<<"4. DeletQ"<<endl;
cout<<"5. Exit"<<endl;
cin>>temp;
switch(temp){
case 1:{
    cout<<3%6;
    cout<<"Enter val:";
    cin>>item;
    enQueue(q,item);
    break;
}
case 2:{
   item=deQueue(q);
   cout<<"Dequed item is:"<<item<<endl;
   system("pause");
    break;
}
case 3:{
    cout<<"The queue size is:"<<qSize(q);
    system("pause");
    break;
}
case 4:{
    deleteQueue(q);
    break;
}
case 5:{
    return 0;
    break;
}
}
}
}