forked from xtaci/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort_demo.cpp
More file actions
117 lines (92 loc) · 2 KB
/
sort_demo.cpp
File metadata and controls
117 lines (92 loc) · 2 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
#include <cstdlib>
#include <iostream>
#include "sort.h"
using namespace std;
using namespace alg;
/////////////////////////////
//
// custom compare function
//
/////////////////////////////
bool comp(int a,int b){
if (a>=b)
return true;
return false;
}
/////////////////////////////
//
// custom swap function
//
///////////////////////////////
void swap(int &a,int &b){
int tmp;
tmp=a;
a=b;
b=tmp;
}
//make rand data
void makeArray(vector<int>& array,int num){
for(size_t i = 0; i < num; ++i)
{
array.push_back(rand()%100);
/* code */
}
}
int main (int argc, char const *argv[])
{
vector<int> a;
alg::SortClass<int> sort(a,comp,swap);
makeArray(a,10);
cout << "############### quick sort ###############" << endl;
cout << "before sort::: " ;
sort.displaySort();
sort.quickSort();
cout << "after sort ::: ";
sort.displaySort();
cout << endl;
a.clear();
makeArray(a,11);
cout << "############### insertion sort ###############" << endl;
cout << "before sort::: " ;
sort.displaySort();
sort.insertSort();
cout << "after sort ::: ";
sort.displaySort();
cout << endl;
a.clear();
makeArray(a,10);
cout << "############### bubble sort ###############" << endl;
cout << "before sort::: " ;
sort.displaySort();
sort.bubbleSort();
cout << "after sort ::: ";
sort.displaySort();
cout << endl;
a.clear();
makeArray(a,10);
cout << "############### selection sort ###############" << endl;
cout << "before sort::: " ;
sort.displaySort();
sort.selectionSort();
cout << "after sort ::: ";
sort.displaySort();
cout << endl;
a.clear();
makeArray(a,10);
cout << "############### heap sort ###############" << endl;
cout << "before sort::: " ;
sort.displaySort();
sort.heapSort();
cout << "after sort ::: ";
sort.displaySort();
cout << endl;
a.clear();
makeArray(a,10);
cout << "############### merge sort ###############" << endl;
cout << "before sort::: " ;
sort.displaySort();
sort.mergeSort();
cout << "after sort ::: ";
sort.displaySort();
return 0;
}