-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUniversity.cpp
More file actions
279 lines (229 loc) · 9.55 KB
/
University.cpp
File metadata and controls
279 lines (229 loc) · 9.55 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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
//University.cpp
#include "University.h"
#include <iostream>
#include "DataSeeder.h"
#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <algorithm>
#include "UserInterface.h"
#include "UserManager.h"
std::string University::getName() const {
return name;
}
void sortUniversities() {
std::vector<University>& universities = DataSeeder::getUniversities();
std::sort(universities.begin(), universities.end(), [](const University& a, const University& b) {
return a.name < b.name;
});
}
void displayAllUniversities() {
const std::vector<University>& universities = DataSeeder::getUniversities();
for (const University& university : universities) {
std::cout << "Name: " << university.getName() << std::endl;
std::cout << "Location: " << university.location << std::endl;
std::cout << "Rank: " << university.rank << std::endl;
std::cout << "AR Score: " << university.arScore << std::endl;
std::cout << "AR Rank: " << university.arRank << std::endl;
std::cout << "ER Score: " << university.erScore << std::endl;
std::cout << "ER Rank: " << university.erRank << std::endl;
std::cout << "FSR Score: " << university.fsrScore << std::endl;
std::cout << "FSR Rank: " << university.fsrRank << std::endl;
std::cout << "CPF Score: " << university.cpfScore << std::endl;
std::cout << "CPF Rank: " << university.cpfRank << std::endl;
std::cout << "IFR Score: " << university.ifrScore << std::endl;
std::cout << "IFR Rank: " << university.ifrRank << std::endl;
std::cout << "ISR Score: " << university.isrScore << std::endl;
std::cout << "ISR Rank: " << university.isrRank << std::endl;
std::cout << "IRN Score: " << university.irnScore << std::endl;
std::cout << "IRN Rank: " << university.irnRank << std::endl;
std::cout << "GER Score: " << university.gerScore << std::endl;
std::cout << "GER Rank: " << university.gerRank << std::endl;
std::cout << "Score Scaled: " << university.scoreScaled << std::endl;
std::cout << "-------------------------" << std::endl;
}
}
University* University::searchUniversityByNameBinary(const std::string& name) {
std::vector<University>& universities = DataSeeder::getUniversities();
sortUniversities();
int low = 0;
int high = universities.size() - 1;
while (low <= high) {
int mid = low + (high - low) / 2;
if (universities[mid].name == name) {
return &universities[mid];
}
if (universities[mid].name < name) {
low = mid + 1;
}
else {
high = mid - 1;
}
}
return nullptr; // University not found
}
University* searchUniversityByRankLinear(int rank) {
std::vector<University>& universities = DataSeeder::getUniversities();
for (int i = 0; i < universities.size(); ++i) {
if (universities[i].rank == rank) {
return &universities[i];
}
}
return nullptr; // University not found
}
University* University::searchUniversityByNameLinear(const std::string& name) {
std::vector<University>& universities = DataSeeder::getUniversities();
for (int i = 0; i < universities.size(); ++i) {
if (universities[i].name == name) {
return &universities[i];
}
}
return nullptr; // University not found
}
University* searchUniversityByRankBinary(int rank) {
std::vector<University>& universities = DataSeeder::getUniversities();
int low = 0;
int high = universities.size() - 1;
while (low <= high) {
int mid = low + (high - low) / 2;
if (universities[mid].rank == rank) {
return &universities[mid];
}
if (universities[mid].rank < rank) {
low = mid + 1;
}
else {
high = mid - 1;
}
}
return nullptr; // University not found
}
void SearchMenu() {
int searchRank; // Rank to be searched
std::string searchName; // Name to be searched
std::cout << "\n\n";
std::cout << "========================\n";
std::cout << "===== Search Menu =====\n";
std::cout << "========================\n";
std::cout << "\n";
std::cout << " 1. Search universities By Rank (Binary Search)\n";
std::cout << " 2. Search universities By Rank (Linear Search)\n";
std::cout << " 3. Search universities By Name (Binary Search)\n";
std::cout << " 4. Search universities By Name (Linear Search)\n";
std::cout << " 0. Main Menu\n";
std::cout << "\n";
std::cout << "========================\n";
std::cout << "Enter your choice: ";
UserManager userManager; // Create a UserManager object
UserInterface ui(userManager);
while (true) {
int choice;
std::cin >> choice;
if (choice < 0 || choice > 4) {
std::cout << "Invalid option. Please try again.\n";
continue; // This will skip the rest of the loop and go back to the beginning
}
switch (choice) {
case 1:
std::cout << "Enter Rank to Search: ";
std::cin >> searchRank;
{
auto start = std::chrono::steady_clock::now();
University* result = searchUniversityByRankBinary(searchRank);
auto end = std::chrono::steady_clock::now();
if (result) {
std::cout << "University found:\n";
std::cout << "Name: " << result->name << std::endl;
std::cout << "Location: " << result->location << std::endl;
std::cout << "Rank: " << result->rank << std::endl;
}
else {
std::cout << "University not found.\n";
}
std::cout << "Execution Time: " << std::chrono::duration<double, std::milli>(end - start).count() << " ms\n";
SearchMenu();
}
break;
case 2:
std::cout << "Enter Rank to Search: ";
std::cin >> searchRank;
{
auto start = std::chrono::steady_clock::now();
University* result = searchUniversityByRankLinear(searchRank);
auto end = std::chrono::steady_clock::now();
if (result) {
std::cout << "University found:\n";
std::cout << "Name: " << result->name << std::endl;
std::cout << "Location: " << result->location << std::endl;
std::cout << "Rank: " << result->rank << std::endl;
}
else {
std::cout << "University not found.\n";
}
std::cout << "Execution Time: " << std::chrono::duration<double, std::milli>(end - start).count() << " ms\n";
SearchMenu();
}
break;
case 3:
std::cout << "Enter Name to Search: ";
std::cin.ignore(); // Ignore the newline character in the input buffer
std::getline(std::cin, searchName);
{
auto start = std::chrono::steady_clock::now();
University* result = University::searchUniversityByNameBinary(searchName);
auto end = std::chrono::steady_clock::now();
if (result) {
std::cout << "University found:\n";
std::cout << "Name: " << result->name << std::endl;
std::cout << "Location: " << result->location << std::endl;
std::cout << "Rank: " << result->rank << std::endl;
}
else {
std::cout << "University not found.\n";
}
std::cout << "Execution Time: " << std::chrono::duration<double, std::milli>(end - start).count() << " ms\n";
SearchMenu();
}
break;
case 4:
std::cout << "Enter Name to Search: ";
std::cin.ignore(); // Ignore the newline character in the input buffer
std::getline(std::cin, searchName);
{
auto start = std::chrono::steady_clock::now();
University* result = University::searchUniversityByNameLinear(searchName);
auto end = std::chrono::steady_clock::now();
if (result) {
std::cout << "University found:\n";
std::cout << "Name: " << result->name << std::endl;
std::cout << "Location: " << result->location << std::endl;
std::cout << "Rank: " << result->rank << std::endl;
}
else {
std::cout << "University not found.\n";
}
std::cout << "Execution Time: " << std::chrono::duration<double, std::milli>(end - start).count() << " ms\n";
SearchMenu();
}
break;
case 0:
return;
}
SearchMenu(); // Recursive call to display the search menu again
return; // Exit the function after the recursive call
}
}
void University::addFeedback(const std::string& feedback) {
feedbacks.push_back(feedback);
}
std::vector<std::string> University::getFeedbacks() const {
return feedbacks;
}
bool University::operator==(const University& other) const {
// Compare the universities based on some criteria (e.g., name)
return name == other.name;
}
void University::addReply(const std::string& reply) {
feedbacks.push_back(reply);
}