-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue_vector.cpp
More file actions
128 lines (104 loc) · 1.87 KB
/
queue_vector.cpp
File metadata and controls
128 lines (104 loc) · 1.87 KB
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
#include <iostream>
#include <locale.h>
//#include <cstdlib>
#include <windows.h>
using namespace std;
const int max_size = 3;
typedef float Data;
typedef struct Queue{
int front, end, logic_size;
Data vector[max_size];
}Queue;
/*
void insert(Queue &q, Data val, bool &ok){
if(q.end == max_size)
ok = false;
else{
ok = true;
q.vector[q.end] = val;
q.end++;
q.logic_size++;
}
}
*/
void insert(Queue &q, Data val, bool &ok){
if((q.end == max_size) && (q.front == 0))
cout << "Full" << endl;
else{
ok = true;
q.vector[q.end] = val;
q.end++;
q.logic_size++;
}
}
void remove(Queue &q, bool &ok){
if(q.end == 0)
ok = false;
else{
ok = true;
q.front++;
q.logic_size--;
}
}
Data search(Queue q, bool &ok){
if(q.end == 0)
ok = false;
else{
ok = true;
return q.vector[q.front];
}
}
void show_queue(Queue q, bool &ok){
if(q.end == 0)
ok = false;
else{
ok = true;
for(int i = q.front; i < q.end; i++)
cout << q.vector[i] << " ";
}
}
main(){
setlocale(LC_ALL, "Portuguese");
bool ok;
Queue queue;
queue.front = 0;
queue.end = 0;
queue.logic_size = 0;
Data value_to_insert;
int option;
while(option != 5){
system("cls");
cout << " 1 INSERT \n 2 REMOVE \n 3 ACCESS \n 4 SHOW QUEUE \n 5 QUIT";
cout << " \nWhat would you like to do? ";
cin >> option;
switch(option){
case 1:
cout << "Value to insert: ";
cin >> value_to_insert;
insert(queue, value_to_insert, ok);
break;
case 2:
remove(queue, ok);
Sleep(5000);
break;
case 3:
search(queue, ok);
if(ok == false)
cout << "Empty queue!" << endl;
else
cout << search(queue, ok) << endl;
case 4:
show_queue(queue, ok);
if(ok == false)
cout << "Empty queue!" << endl;
Sleep(2000);
break;
default:
cout << "Invalid option!" << endl;
break;
}
if(!cin)
break;
}
system("Pause");
}