Sorting-Comparison/sort.cpp at master · Abd-ELrahmanHamza/Sorting-Comparison · 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
#include <iostream>
#include <chrono>
#include <fstream>
#include <vector>
#include <string>
#include "insertionSort.h"
#include "selectionSort.h"
#include "quickSort.h"
#include "mergeSort.h"
#include "readPrintFile.h"
#include "hybridSort.h"
using namespace std;
using namespace std::chrono;

void printVector(const vector<int> &v) {
    for (int x: v)
        cout << x << " ";
    cout << endl;
}

long long selectionSortTime(vector<int> &data) {
    auto start = high_resolution_clock::now();
    selection_sort(data);
    auto stop = high_resolution_clock::now();
    auto duration = duration_cast<milliseconds>(stop - start);
    return duration.count();
}

long long insertionSortTime(vector<int> &data) {
    auto start = high_resolution_clock::now();
    insertion_sort(data);
    auto stop = high_resolution_clock::now();
    auto duration = duration_cast<milliseconds>(stop - start);
    return duration.count();
}

long long mergeSortTime(vector<int> &data) {
    auto start = high_resolution_clock::now();
    merge_sort(data, 0, (int) data.size() - 1);
    auto stop = high_resolution_clock::now();
    auto duration = duration_cast<milliseconds>(stop - start);
    return duration.count();
}

long long quickSortTime(vector<int> &data) {
    auto start = high_resolution_clock::now();
    randomized_quick_sort(data, 0, (int)data.size() - 1);
    auto stop = high_resolution_clock::now();
    auto duration = duration_cast<milliseconds>(stop - start);
    return duration.count();
}
long long hybridSortTime(vector<int> &data) {
    auto start = high_resolution_clock::now();
    hybrid_sort(data, 0, (int)data.size() - 1);
    auto stop = high_resolution_clock::now();
    auto duration = duration_cast<milliseconds>(stop - start);
    return duration.count();
}

long long selectAlgorithm(vector<int> &data, int algorithmNum) {
    long long runningTime = 0;
    switch (algorithmNum) {
        case 0:
            runningTime = selectionSortTime(data);
            break;
        case 1:
            runningTime = insertionSortTime(data);
            break;
        case 2:
            runningTime = mergeSortTime(data);
            break;
        case 3:
            runningTime = quickSortTime(data);
            break;
        case 4:
            runningTime = hybridSortTime(data);
            break;
        default:
            break;
    }
    return runningTime;
}

int main(int argc, char *argv[]) {
    int algorithmNum = argv[1][0] - '0';
    string inputPath(argv[2]);
    string outputPath(argv[3]);
    string timePath(argv[4]);

    vector<int> data;
    readFile(inputPath, data);
    long long runningTime = selectAlgorithm(data, algorithmNum);
    printFile(outputPath, data);
    printTime(timePath,runningTime);
    return 0;
}