SortingAlgorithms/main.cpp at main · Nicholas-Ball/SortingAlgorithms · 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
#include <iostream>
#include <chrono>
#include <vector>
#include "sorting.h"


using namespace std::chrono;

void testQuick()
{
    int total = 0;
    for(int i = 0; i != 1000;i++){
        //make a list
        int x[500];
        for(int i = 0; i != 500; i++)
            x[i] = (rand()%1000)+1;

        auto start = high_resolution_clock::now();

        Sorting::QuickSort(x,(int)( sizeof(x) / sizeof(int)));

        auto stop = high_resolution_clock::now();

        auto duration = duration_cast<microseconds>(stop - start);
        total += duration.count();
    }
    std::cout << "Average Time taken by QuickSort: "<< (total/1000)<< " microseconds" << std::endl;
}

void testMerge()
{
    int total = 0;
    for(int i = 0; i != 1000;i++){
        //make a list
        int x[500];
        for(int i = 0; i != 500; i++)
            x[i] = (rand()%1000)+1;
        auto start = high_resolution_clock::now();

        Sorting::MergeSort(x,(int)( sizeof(x) / sizeof(int)));

        auto stop = high_resolution_clock::now();

        auto duration = duration_cast<microseconds>(stop - start);
        total += duration.count();
    }
    std::cout << "Average Time taken by MergeSort: "<< (total/1000)<< " microseconds" << std::endl;

}

int main()
{
    /**/
    int x[] = {5,65,8,12,64,8};
    testMerge();
    testQuick();

    Sorting::MergeSort(x,(int)( sizeof(x) / sizeof(int)));

    for(int i = 0; i != (int)( sizeof(x) / sizeof(int)); i++){
        printf("%d ",x[i]);
    }
    printf("\n");

    std::cout<<Sorting::BinarySearch(x,(int)( sizeof(x) / sizeof(int)),-3)<<std::endl;
    /**/

    return 0;
}