Sorting-Algorithms/main.cpp at master · amarsgithub/Sorting-Algorithms · 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
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
#include "SortingAlgorithms.h"

int main(int argc, char **argv)
{
    SortingAlgorithms algorithmObject;

    // If the user has entered less than 2 command line arguments:
    if (argc < 2)
    {
        cout << "Invalid input. Expected: " << endl;
        cout << "./a.out <Number of Elements>" << endl;
        return -1;
    }

    // Converts the second input argument to an int:
    algorithmObject.SetCount(atoi(argv[1]));

    // The following function creates the array inside the algorithmObject object
    // and assigns random values to all of the elements
    algorithmObject.Randomize();

// |===========================================================================|
// |                               Bubble Sort                                 |
// |===========================================================================|

    {
        cout << "Testing Bubble Sort..." << endl;
        SimpleTimer myTimer("bucket sort");
        algorithmObject.BubbleSort();
    }

    if (algorithmObject.isSorted())
        cout << "Bubble sort worked successfully." << endl;
    else
        cout << "Bubble sort failed." << endl;


// |===========================================================================|
// |                           Selection Sort                                  |
// |===========================================================================|

    cout << endl << endl;
    algorithmObject.Randomize();

    {
        cout << "Testing Selection Sort..." << endl;
        SimpleTimer myTimer("selection sort");
        algorithmObject.SelectionSort();
    }

    if (algorithmObject.isSorted())
        cout << "Selection sort worked successfully." << endl;
    else
        cout << "Selection sort failed." << endl;

// |===========================================================================|
// |                             Insertion Sort                                |
// |===========================================================================|

    cout << endl << endl;
    algorithmObject.Randomize();
    {
        cout << "Testing Insertion Sort..." << endl;
        SimpleTimer myTimer("insertion sort");
        algorithmObject.InsertionSort();
    }
    if (algorithmObject.isSorted())
        cout << "Insertion sort worked successfully." << endl;
    else
        cout << "Insertion sort failed." << endl;

// |===========================================================================|
// |                               Merge Sort                                  |
// |===========================================================================|


    cout << endl << endl;
    algorithmObject.Randomize();
    {
        cout << "Testing Merge Sort..." << endl;
        SimpleTimer myTimer("merge sort");
        algorithmObject.MergeSort();
    }
    if (algorithmObject.isSorted())
        cout << "Merge sort worked successfully." << endl;
    else
        cout << "Merge sort failed." << endl;

// |===========================================================================|
// |                              Quick Sort                                   |
// |===========================================================================|

    cout << endl << endl;
    algorithmObject.Randomize();
    {
        cout << "Testing Quick Sort..." << endl;
        SimpleTimer myTimer("quick sort");
        algorithmObject.QuickSort();
    }
    if (algorithmObject.isSorted())
        cout << "Quick sort worked successfully." << endl;
    else
        cout << "Quick sort failed." << endl;

// |===========================================================================|
// |                              Quick Sort                                   |
// |===========================================================================|

    cout << endl << endl;
    algorithmObject.Randomize();
    {
        cout << "Testing Shell Sort..." << endl;
        SimpleTimer myTimer("shell sort");
        algorithmObject.ShellSort();
    }
    if (algorithmObject.isSorted())
        cout << "Shell sort worked successfully." << endl;
    else
        cout << "Shell sort failed." << endl;

    return 0;
}