(
inti = 0; i < sz; i++) std::cout << arr[i] <<
" ";
58voidheapify(T *arr,
intn,
inti) {
63 if(l < n && arr[l] > arr[largest])
66 if(r < n && arr[r] > arr[largest])
70std::swap(arr[i], arr[largest]);
71heapify(arr, n, largest);
85 for(
inti = n - 1; i >= 0; i--) heapify(arr, n, i);
87 for(
inti = n - 1; i >= 0; i--) {
88std::swap(arr[0], arr[i]);
100std::cout <<
"Test 1\n";
101 intarr[] = {-10, 78, -1, -6, 7, 4, 94, 5, 99, 0};
102 intsz =
sizeof(arr) /
sizeof(arr[0]);
106assert(std::is_sorted(arr, arr + sz));
107std::cout <<
"Test 1 Passed\n========================\n";
109std::cout <<
"Test 2\n";
110 doublearr2[] = {4.5, -3.6, 7.6, 0, 12.9};
111sz =
sizeof(arr2) /
sizeof(arr2[0]);
115assert(std::is_sorted(arr2, arr2 + sz));
116std::cout <<
"Test 2 passed\n";
double l(double x)
Another test function.
void heapSort(T *arr, int n)
void printArray(T *arr, int sz)
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