Sorting-Algorithms/Cpp/AlgorithmComparison.cpp at 4699e2ccd1a3d4a2388b52dd4f9615d16cd6fb12 · diptangsu/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
/**
* Compares various sorting algorithms.
* To execute, compile files using:
* g++ *.cpp -o output
* Run:
* output.exe
*/

#include <bits/stdc++.h>
#include <algorithm>
#include <chrono>
#include<string>

#include "sort_type.h"
#include "sorting_algorithms.h"

using namespace std;

int SIZE = 600;
int MAX_ELEMENT = 1000;

void printSortingTime(SortType sortType, int arr[]){
	int arrCopy[SIZE];
	copy(arr, arr + SIZE, arrCopy);
	string algorithmUsed = "";

	auto start = chrono::high_resolution_clock::now();

	switch(sortType){
		case BUBBLE:
			bubbleSort(arrCopy, SIZE);
			algorithmUsed = "BUBBLE_SORT";
			break;
		case COUNT:
			countSort(arrCopy, SIZE);
			algorithmUsed = "COUNT_SORT";
			break;
		case CYCLE:
			countSort(arrCopy, SIZE);
			algorithmUsed = "CYCLE_SORT";
			break;
		case HEAP:
			heapSort(arrCopy, SIZE);
			algorithmUsed = "HEAP_SORT";
			break;
		case INSERTION:
			insertionSort(arrCopy, SIZE);
			algorithmUsed = "INSERTION_SORT";
			break;
		case MERGE:
			MergeSort(arrCopy, 0, SIZE - 1);
			algorithmUsed = "MERGE_SORT";
			break;
		case QUICK:
			quickSort(arrCopy, 0, SIZE - 1);
			algorithmUsed = "QUICK_SORT";
			break;
		case SELECTION:
			selectionSort(arrCopy, SIZE);
			algorithmUsed = "SELECTION_SORT";
			break;
	}

	auto finish = chrono::high_resolution_clock::now();
	auto timeTaken = chrono::duration_cast<chrono::nanoseconds>(finish-start).count();
	printf("%-17s %15d \n", algorithmUsed.c_str(), timeTaken);

}

void compareSortingAlgorithms(int arr[]){
	printSortingTime(SortType::BUBBLE, arr);
	printSortingTime(SortType::COUNT, arr);
	printSortingTime(SortType::CYCLE, arr);
    printSortingTime(SortType::HEAP, arr);
    printSortingTime(SortType::INSERTION, arr);
    printSortingTime(SortType::MERGE, arr);
    printSortingTime(SortType::QUICK, arr);
    printSortingTime(SortType::SELECTION, arr);
}

int main(){
	int arr[SIZE];

	for(int i = 0; i < SIZE; i++){
		arr[i] = rand() % MAX_ELEMENT;
	}

	cout << "Array length = " << SIZE << endl;
	cout << "\nElements randomly distributed: " << endl;
	cout << "\nSorting Algorithm\tTime Taken(ns)" << endl;

	compareSortingAlgorithms(arr);

	cout << "\nElements already sorted: " << endl;
	cout << "\nSorting Algorithm\tTime Taken(ns)" << endl;

	sort(arr, arr + SIZE);
	compareSortingAlgorithms(arr);

	cout << "\nElements sorted in reverse order:" << endl;
	cout << "\nSorting Algorithm\tTime Taken(ns)" << endl;

	reverse(arr, arr + SIZE);
	compareSortingAlgorithms(arr);
}