std::vector<uint64_t> selectionSort(
conststd::vector<uint64_t> &arr,
50std::vector<uint64_t> array(
53 for(uint64_t it = 0; it < len; ++it) {
55 for(uint64_t it2 = it + 1; it2 < len; ++it2) {
56 if(array[it2] < array[min]) {
62uint64_t tmp = array[min];
63array[min] = array[it];
79std::vector<uint64_t> vector1 = {1, 0, 0, 1, 1, 0, 2, 1};
80uint64_t vector1size = vector1.size();
81std::cout <<
"1st test... ";
82std::vector<uint64_t> result_test1;
83result_test1 = sorting::selectionSort(vector1, vector1size);
84assert(std::is_sorted(result_test1.begin(), result_test1.end()));
85std::cout <<
"Passed"<< std::endl;
90std::vector<uint64_t> vector2 = {19, 22, 540, 241, 156, 140, 12, 1};
91uint64_t vector2size = vector2.size();
92std::cout <<
"2nd test... ";
93std::vector<uint64_t> result_test2;
94result_test2 = sorting::selectionSort(vector2, vector2size);
95assert(std::is_sorted(result_test2.begin(), result_test2.end()));
96std::cout <<
"Passed"<< std::endl;
100std::vector<uint64_t> vector3 = {11, 20, 30, 41, 15, 60, 82, 15};
101uint64_t vector3size = vector3.size();
102std::cout <<
"3rd test... ";
103std::vector<uint64_t> result_test3;
104result_test3 = sorting::selectionSort(vector3, vector3size);
105assert(std::is_sorted(result_test3.begin(), result_test3.end()));
106std::cout <<
"Passed"<< std::endl;
111std::vector<uint64_t> vector4 = {1, 9, 11, 546, 26, 65, 212, 14};
112uint64_t vector4size = vector2.size();
113std::cout <<
"4th test... ";
114std::vector<uint64_t> result_test4;
115result_test4 = sorting::selectionSort(vector4, vector4size);
116assert(std::is_sorted(result_test4.begin(), result_test4.end()));
117std::cout <<
"Passed"<< std::endl;
static void test()
Self-test implementations.
int main()
Main function.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4