-
Notifications
You must be signed in to change notification settings - Fork 0
/
algorithms.cpp
130 lines (90 loc) · 3.13 KB
/
algorithms.cpp
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
123
124
125
126
127
128
129
130
#include <iostream>
#include <cstdlib> //required for rand(), srand()
#include <ctime> //required for time()
/*
#include "sort/merge_sort.hpp"
#include "sort/heap_sort.hpp"
#include "sort/linear_sort.hpp"
#include "sort/hierarchical_sorting.hpp"
#include "sort/radix_sort.hpp"
#include "sort/insertion_sort.hpp"
#include "sort/selection_sort.hpp"
#include "sort/bubble_sort.hpp"
#include "sort/shell_sort.hpp"
#include "sort/counting_sort.hpp"
#include "sort/binary_insertion_sort.hpp"
#include "sort/tim_sort.hpp"
#include "sort/quick_sort.hpp"
#include "sort/tree_sort.hpp"
#include "search/binary_search.hpp"
#include "search/linear_search.hpp"
#include "reverse/reverse.hpp"
*/
#include "sort/merge_sort_inplace.hpp"
template<typename T> void print_array(T* arr, size_t const& length);
template<typename T> void print_array_and_check(
T* arr,
size_t const& length ,
bool &is_sorted ,
bool (* const& compare_function)(T const& a, T const& b)
);
template<typename T> void fill_array(
T* arr,
size_t& size,
T const& min_value, T const& max_value
);
bool cp_fn( int const& target, int const& element ) {
return target < element;
}
int main() {
/*
int arr[9] = { 4,88,-1,5,-5,47,0,61,1 };
int arr[9] = { 9,-8,7,6,-5,4,-3,2,1 };
unsigned int arr[10] = { 4,4,4,4,100, 4,20,50,4,4 };
int arr[20] = { 120,999,890,700,6213,5156,42563,314,33234,9,-8,7,6,-5,4,-3,2,1 };
int arr[11] = { 11,10,9,8,7,6,5,4,3,2,1 };
int arr[10] = { 3,7,6,5,4,0,9,8,1,11 };
*/
int testing = 0;
int max_tests = 10;
while(++testing < max_tests){
std::cout << "=============================================" << std::endl;
bool sort_rslt = false;
int sizes[6] = { 350,200,523,1254,426,64 };
int size = 21;
int* arr = new int[size];
fill_array<int>(arr, (size_t&)size, 0, 40);
std::cout << "Generated Data Is ::\n";
print_array_and_check<int>(arr, (size_t)size - 1, sort_rslt, cp_fn);
sort::merge_sort_inplace<int>(arr, 0, size - 1, cp_fn);
std::cout << '\n';
std::cout << "Sorting Result Is ::\n";
print_array_and_check<int>(arr, (size_t)size - 1, sort_rslt, cp_fn);
std::cout << "\nSorting Is :: " << (sort_rslt ? "true" : "false") << '\n';
delete arr;
}
return 0;
}
template<typename T> void fill_array(T* arr, size_t& size , T const& min_value , T const& max_value) {
std::srand(std::time(0));
for (size_t i = 0; i < size; i += 1) arr[i] = (std::rand() % max_value + min_value);
}
template<typename T> void print_array(T* arr, size_t const& length) {
for (size_t i = 0; i < length; i += 1) {
std::cout << arr[i] << " , ";
}
std::cout << '\n';
}
template<typename T> void print_array_and_check(
T* arr,
size_t const& length,
bool& is_sorted,
bool (* const& compare_function)(T const& a, T const& b)
) {
is_sorted = true;
for (size_t i = 0 , c = 1 ; i < length ; i += 1 , c = c + 1 ) {
if (arr[i] != arr[c] && !compare_function(arr[i], arr[c]) && is_sorted != NULL) is_sorted = false;
std::cout << arr[i] << " ,";
}
std::cout << arr[length] << '\n';
}