-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
352 lines (286 loc) · 11.6 KB
/
Copy pathmain.cpp
File metadata and controls
352 lines (286 loc) · 11.6 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
348
349
350
351
352
// https://github.com/HaiDuc0147/sortingAlgorithm/blob/main/reportSort/Sort.cpp
// Libraries initialized in other places
#include "sorting-algo/SortingAlgorithms.hpp"
#include "helper/Helper.hpp"
// Built-in libraries used in this source
#include <iostream>
#include <functional>
#include <unordered_map>
#include <string>
#include <fstream>
#include <chrono>
#include <cstring>
// To use steady_clock
using namespace std::chrono;
std::unordered_map<std::string, std::function<void(int *, int)>>
algorithms = {
{"bubble-sort", BubbleSort},
{"optimised-bubble-sort", OptimisedBubbleSort},
{"counting-sort", CountingSort},
{"flash-sort", FlashSort},
{"heap-sort", HeapSort},
{"insertion-sort", InsertionSort},
{"binary-insertion-sort", BinaryInsertionSort},
{"merge-sort", MergeSort},
{"quick-sort", QuickSort},
{"radix-sort", RadixSort},
{"selection-sort", SelectionSort},
{"shaker-sort", ShakerSort},
{"shell-sort", ShellSort}};
std::unordered_map<std::string, std::function<void(int *, int, ull &)>>
algorithmsCount = {
{"bubble-sort", BubbleSortCountComp},
{"optimised-bubble-sort", OptimisedBubbleSortCountComp},
{"counting-sort", CountingSortCountComp},
{"flash-sort", FlashSortCountComp},
{"heap-sort", HeapSortCountComp},
{"insertion-sort", InsertionSortCountComp},
{"binary-insertion-sort", BinaryInsertionSortCountComp},
{"merge-sort", MergeSortCountComp},
{"quick-sort", QuickSortCountComp},
{"radix-sort", RadixSortCountComp},
{"selection-sort", SelectionSortCountComp},
{"shaker-sort", ShakerSortCountComp},
{"shell-sort", ShellSortCountComp}};
std::unordered_map<std::string, int>
dataOrder = {
{"-rand", 0},
{"-sorted", 1},
{"-rev", 2},
{"-nsorted", 3}};
int main(int argc, const char *argv[])
{
std::string outFileName = "output.txt";
if (strcmp(argv[1], "-a") == 0)
{
// Print title
std::cout << "ALGORITHM MODE" << endl;
// Get the algorithm name
std::string algoName = argv[2];
// Print algorithm name
std::cout << "Algorithm: " << algoName << endl;
// Algorithm mode
if (argc == 5)
{
if (auto algo = algorithms.find(algoName); algo != algorithms.end())
{
// The 'atoi' function return 0 if the cstring cannot be converted to integer.
int checkChar = atoi(argv[3]);
// Command 1
if (checkChar == 0)
{
// Print input-data file-name
std::cout << "Input file: " << argv[3] << endl;
// Input data
int size;
int *a;
InputArrayFromTxtFile(a, size, argv[3]);
// Print size of input data
std::cout << "Input size: " << size << endl;
std::cout << "-------------------------\n";
// Mesure running time
ull runningTime = MeasureRunningTime(algo->second, a, size);
// Write sorted array to txt file
WriteArrayToTxtFile(a, size, outFileName.c_str());
// Count comparison
ull countCompare = 0;
algorithmsCount[algoName](a, size, countCompare);
// Print result
PrintResult(argv[4], runningTime, countCompare);
std::cout << "\n\n";
// Delete a
delete[] a;
}
// Command 3
// If the argv[3] is not char, then it is integer.
else
{
// We have convert argv[3] to integer at the start of this if-else
int size = checkChar;
// Print input size
std::cout << "Input size: " << size << endl
<< endl;
for (auto order : dataOrder)
{
// Get the order index
int orderIdx = order.second;
// Print the order name
PrintOrderName(orderIdx);
// Generate data
int *a = new int[size];
GenerateData(a, size, orderIdx);
// Write input data to text file
std::string textFileName = "input_";
textFileName += to_string(orderIdx + 1);
textFileName += ".txt";
WriteArrayToTxtFile(a, size, textFileName.c_str());
// Measure running time
ull runningTime = MeasureRunningTime(algo->second, a, size);
// Count comparison
ull countCompare = 0;
algorithmsCount[algoName](a, size, countCompare);
// Print result
PrintResult(argv[4], runningTime, countCompare);
std::cout << "\n\n";
}
}
}
else
{
std::cout << "Algorithm not found!\n";
}
}
// Command 2
else if (argc == 6)
{
if (auto algo = algorithms.find(algoName); algo != algorithms.end())
{
// We convert argv[3] to integer
int size = atoi(argv[3]);
// Print input size
std::cout << "Input size: " << size << endl;
// Get input order
std::string order = argv[4];
// Print input order
PrintOrderName(dataOrder[order]);
// Get order index
int orderIdx = dataOrder[order];
// Generate data
int *a = new int[size];
GenerateData(a, size, orderIdx);
// Write input data to text file
std::string textFileName = "input.txt";
WriteArrayToTxtFile(a, size, textFileName.c_str());
// Measure running time
ull runningTime = MeasureRunningTime(algo->second, a, size);
// Write sorted array to txt file
WriteArrayToTxtFile(a, size, outFileName.c_str());
// Count comparison
ull countCompare = 0;
algorithmsCount[algoName](a, size, countCompare);
// Print result
PrintResult(argv[5], runningTime, countCompare);
// Write experimental results to .csv file
WriteExperimentalResultToCsvFile(algoName, orderIdx, size, runningTime, countCompare);
std::cout << "\n\n";
delete[] a;
}
else
{
std::cout << "Algorithm not found!\n";
}
}
else
{
std::cout << "Error: Invalid number of arguments." << endl;
}
}
// Comparison mode
else if (strcmp(argv[1], "-c") == 0)
{
// Print title
std::cout << "COMPARISON MODE" << endl;
// Get the algorithms name
std::string algoName1 = argv[2];
std::string algoName2 = argv[3];
// Print algorithms name
std::cout << "Algorithm: " << algoName1 << " | " << algoName2 << endl;
// Command 4
if (argc == 5)
{
if (auto algo1 = algorithms.find(algoName1); algo1 != algorithms.end())
{
if (auto algo2 = algorithms.find(algoName2); algo2 != algorithms.end())
{
// Input data from text file
int size;
int *a;
InputArrayFromTxtFile(a, size, argv[4]);
// Print input-data file-name
std::cout << "Input file: " << argv[4] << endl;
// Print input size
std::cout << "Input size: " << size << endl;
std::cout << "-------------------------\n";
// Measure running time
ull runningTime1 = MeasureRunningTime(algo1->second, a, size);
ull runningTime2 = MeasureRunningTime(algo2->second, a, size);
// Count comparison
ull countCompare1 = 0;
ull countCompare2 = 0;
algorithmsCount[algoName1](a, size, countCompare1);
algorithmsCount[algoName2](a, size, countCompare2);
// Print result
std::cout << "Running time: " << runningTime1 << " | " << runningTime2 << endl;
std::cout << "Comparisons: " << countCompare1 << " | " << countCompare2 << endl;
std::cout << "\n\n";
delete[] a;
}
else
{
std::cout << "Algorithm 2 not found.\n";
}
}
else
{
std::cout << "Algorithm 1 not found.\n";
}
}
// Command 5
else if (argc == 6)
{
if (auto algo1 = algorithms.find(algoName1); algo1 != algorithms.end())
{
if (auto algo2 = algorithms.find(algoName2); algo2 != algorithms.end())
{
// We convert argv[4] to integer
int size = atoi(argv[4]);
// Print input size
std::cout << "Input size: " << size << endl;
// Get input order
std::string order = argv[5];
// Print input order
PrintOrderName(dataOrder[order]);
// Get order index
int orderIdx = dataOrder[order];
// Generate data
int *a = new int[size];
GenerateData(a, size, orderIdx);
// Write input data to text file
std::string textFileName = "input.txt";
WriteArrayToTxtFile(a, size, textFileName.c_str());
std::cout << "-------------------------\n";
// Measure running time
ull runningTime1 = MeasureRunningTime(algo1->second, a, size);
ull runningTime2 = MeasureRunningTime(algo2->second, a, size);
// Count comparison
ull countCompare1 = 0;
ull countCompare2 = 0;
algorithmsCount[algoName1](a, size, countCompare1);
algorithmsCount[algoName2](a, size, countCompare2);
// Print result
std::cout << "Running time: " << runningTime1 << " | " << runningTime2 << endl;
std::cout << "Comparisons: " << countCompare1 << " | " << countCompare2 << endl;
std::cout << "\n\n";
delete[] a;
}
else
{
std::cout << "Algorithm 2 not found.\n";
}
}
else
{
std::cout << "Algorithm 1 not found.\n";
}
}
else
{
std::cout << "Error: Invalid number of arguments." << endl;
}
}
else
{
std::cout << "Error: Flag cannot be found." << endl;
}
return 0;
}