Repository navigation
Expand file tree
/
Copy pathsorts.cpp
More file actions
347 lines (327 loc) · 10.3 KB
/
Copy pathsorts.cpp
File metadata and controls
347 lines (327 loc) · 10.3 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
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
#include "sorts.h"
void sortMake(std::vector<cars>& carData, std::vector<cars>& ans, std::string make, std::vector<std::string>& validMakes,std::string isAuto) {
bool validMakeFound = false;
for (auto makes: validMakes) {
if (makes == make)
validMakeFound = true;
}
if (validMakeFound) {
for (int i = 0; i < carData.size(); i++) {
if (carData[i].getMake() == make && carData[i].getAutoOrManual() == isAuto) {
ans.push_back(carData[i]);//Data in csv already sorted by make
}
}
}else{
for (int i = 0; i < carData.size(); i++) {
ans.push_back(carData[i]);//Still have to put something in answer if there is no proper make, data will be unsorted
}
}
}
void mergeHP(std::vector<cars>& carData, int start, int mid, int end) {
int len1 = mid - start + 1;
int len2 = end - mid;
std::vector<cars> vect1;
std::vector<cars> vect2;
for (int i = 0; i < len1; i++) {
vect1.push_back(carData[start + i]);
}
for(int i = 0; i < len2; i++) {
vect2.push_back(carData[mid + 1 + i]);
}
int i = 0;
int j = 0;
int k = start;
while (i < len1 && j < len2) {
if (vect1[i].getHorsepower() <= vect2[j].getHorsepower()) {
carData[k] = vect1[i];
i++;
}
else {
carData[k] = vect2[j];
j++;
}
k++;
}
while (i < len1) {
carData[k] = vect1[i];
i++;
k++;
}
while (j < len2) {
carData[k] = vect2[j];
j++;
k++;
}
}
void mergeSortHP(std::vector<cars>& carData, int start, int end) {
if (start == end) {
return;
}
int mid = (start + end) / 2;
mergeSortHP(carData, start, mid);
mergeSortHP(carData, mid + 1, end);
mergeHP(carData, start, mid, end);
}
void mergeSortHorsepower(std::vector<cars>& carData, std::vector<cars>& ans, std::string isAuto) {
mergeSortHP(carData, 0, carData.size() - 1);
for (int i = carData.size() - 1; i > carData.size() - 1001; i--) {
if(carData[i].getAutoOrManual() == isAuto)
ans.push_back(carData[i]);
}
}
int qPartitionHP(std::vector<cars>& carData, int low, int high) {
int pivot = carData[high].getHorsepower();
int up = low;
int down = high - 1;
while (up <= down) {
while (up <= down && carData[up].getHorsepower() <= pivot) {
up++;
}
while (down >= up && carData[down].getHorsepower() >= pivot) {
down--;
}
if (up < down) {
cars temp = carData[up];
carData[up] = carData[down];
carData[down] = temp;
}
}
cars temp = carData[up];
carData[up] = carData[high];
carData[high] = temp;
return up;
}
void quickSortHP(std::vector<cars>& carData, int low, int high) {
if (low < high) {
int pivot = qPartitionHP(carData, low, high);
quickSortHP(carData, low, pivot - 1);
quickSortHP(carData, pivot + 1, high);
}
return;
}
void quickSortHorsepower(std::vector<cars>& carData, std::vector<cars>& ans, std::string isAuto) {
quickSortHP(carData, 0, carData.size() - 1);
for (int i = carData.size() - 1; i > carData.size() - 1001; i--) {
if(carData[i].getAutoOrManual() == isAuto)
ans.push_back(carData[i]);
}
}
int qPartitionC(std::vector<cars>& carData, int low, int high) {
int pivot = carData[high].getCityMPG();
int up = low;
int down = high - 1;
while (up <= down) {
while (up <= down && carData[up].getCityMPG() <= pivot) {
up++;
}
while (down >= up && carData[down].getCityMPG() >= pivot) {
down--;
}
if (up < down) {
cars temp = carData[up];
carData[up] = carData[down];
carData[down] = temp;
}
}
cars temp = carData[up];
carData[up] = carData[high];
carData[high] = temp;
return up;
}
void quickSortC(std::vector<cars>& carData, int low, int high) {
if (low < high) {
int pivot = qPartitionC(carData, low, high);
quickSortC(carData, low, pivot - 1);
quickSortC(carData, pivot + 1, high);
}
return;
}
void quickSortGasCity(std::vector<cars>& carData, std::vector<cars>& ans, std::string isAuto) {
quickSortC(carData, 0, carData.size()-1);
for (int i = carData.size() - 1; i > carData.size() - 1001; i--) {
if(carData[i].getAutoOrManual() == isAuto)
ans.push_back(carData[i]);
}
return;
}
void mergeC(std::vector<cars>& carData, int start, int mid, int end) {
int len1 = mid - start + 1;
int len2 = end - mid;
std::vector<cars> vect1;
std::vector<cars> vect2;
for (int i = 0; i < len1; i++) {
vect1.push_back(carData[start + i]);
}
for(int i = 0; i < len2; i++) {
vect2.push_back(carData[mid + 1 + i]);
}
int i = 0;
int j = 0;
int k = start;
while (i < len1 && j < len2) {
if (vect1[i].getCityMPG() <= vect2[j].getCityMPG()) {
carData[k] = vect1[i];
i++;
}
else {
carData[k] = vect2[j];
j++;
}
k++;
}
while (i < len1) {
carData[k] = vect1[i];
i++;
k++;
}
while (j < len2) {
carData[k] = vect2[j];
j++;
k++;
}
}
void mergeSortC(std::vector<cars>& carData, int start, int end) {
if (start == end) {
return;
}
int mid = (start + end) / 2;
mergeSortC(carData, start, mid);
mergeSortC(carData, mid + 1, end);
mergeC(carData, start, mid, end);
}
void mergeSortGasCity(std::vector<cars>& carData, std::vector<cars>& ans, std::string isAuto) {
mergeSortC(carData, 0, carData.size()-1);
for (int i = carData.size() - 1; i > carData.size() - 1001; i--) {
if(carData[i].getAutoOrManual() == isAuto)
ans.push_back(carData[i]);
}
return;
}
int qPartitionH(std::vector<cars>& carData, int low, int high) {
int pivot = carData[high].getHighwayMPG();
int up = low;
int down = high - 1;
while (up <= down) {
while (up <= down && carData[up].getHighwayMPG() <= pivot) {
up++;
}
while (down >= up && carData[down].getHighwayMPG() >= pivot) {
down--;
}
if (up < down) {
cars temp = carData[up];
carData[up] = carData[down];
carData[down] = temp;
}
}
cars temp = carData[up];
carData[up] = carData[high];
carData[high] = temp;
return up;
}
void quickSortH(std::vector<cars>& carData, int low, int high) {
if (low < high) {
int pivot = qPartitionH(carData, low, high);
quickSortH(carData, low, pivot - 1);
quickSortH(carData, pivot + 1, high);
}
return;
}
void quickSortGasHighway(std::vector<cars>& carData, std::vector<cars>& ans, std::string isAuto) {
quickSortH(carData, 0, carData.size() - 1);
for (int i = carData.size() - 1; i > carData.size() - 1001; i--) {
if(carData[i].getAutoOrManual() == isAuto)
ans.push_back(carData[i]);
}
return;
}
void mergeHW(std::vector<cars>& carData, int start, int mid, int end) {
int len1 = mid - start + 1;
int len2 = end - mid;
std::vector<cars> vect1;
std::vector<cars> vect2;
for (int i = 0; i < len1; i++) {
vect1.push_back(carData[start + i]);
}
for(int i = 0; i < len2; i++) {
vect2.push_back(carData[mid + 1 + i]);
}
int i = 0;
int j = 0;
int k = start;
while (i < len1 && j < len2) {
if (vect1[i].getHighwayMPG() <= vect2[j].getHighwayMPG()) {
carData[k] = vect1[i];
i++;
}
else {
carData[k] = vect2[j];
j++;
}
k++;
}
while (i < len1) {
carData[k] = vect1[i];
i++;
k++;
}
while (j < len2) {
carData[k] = vect2[j];
j++;
k++;
}
}
void mergeSortHW(std::vector<cars>& carData, int start, int end) {
if (start == end) {
return;
}
int mid = (start + end) / 2;
mergeSortHW(carData, start, mid);
mergeSortHW(carData, mid + 1, end);
mergeHW(carData, start, mid, end);
}
void mergeSortGasHighway(std::vector<cars>& carData, std::vector<cars>& ans, std::string isAuto) {
mergeSortHW(carData, 0, carData.size()-1);
for (int i = carData.size() - 1; i > carData.size() - 1001; i--) {
if(carData[i].getAutoOrManual() == isAuto)
ans.push_back(carData[i]);
}
return;
}
void sortCityWeather(std::vector<weather>& weatherData, std::string location,std::vector<cars>& carData, std::vector<std::string>& validStates){
bool valStateEntered = false;
for(auto state: validStates){
if(state == location){
valStateEntered = true;
break;
}
}
if(!valStateEntered)
return;
int freezeCount = 0; //# of times the min temp is recorded as below freezing
bool allowRWD = true; //determines if rear-wheel drive will appear in results
for(auto element: weatherData){
if(element.getState() == location && element.getMinTemp() < 32){
freezeCount++;
}
if(freezeCount >= 1){//ends loop early if threshold has been met
allowRWD = false;//don't allow RWD to appear in results if it is below freezing for 1/4 of the year or more
break;
}
}
std::vector<cars> temp;
std::vector<cars> tempRWD;
if(!allowRWD){
for(auto car : carData){
if(car.getDriveLine() != "Rear-wheel drive" && car.getDriveLine() != "Front-wheel drive"){
temp.push_back(car); //filter out rwd
}
}
for(auto car : carData){
if(car.getDriveLine() == "Rear-wheel drive" && car.getDriveLine() == "Front-wheel drive"){
temp.push_back(car); //filter out rwd
}
}
carData = temp;
}
}