OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

switched to normal functions from lambda

Browse Source
This commit is contained in:
Ayaan Khan 2020-06-21 17:06:17 +05:30
parent 7e4fb1f6af
commit ced5dcd6c4
1 changed files with 11 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
sorting/heap_sort.cpp
View File

@ -33,10 +33,10 @@
* @param sz size of array
*
*/
auto printArray = [](int *arr, int sz) {
void printArray(int *arr, int sz) {
for (int i = 0; i < sz; i++) std::cout << arr[i] << " ";
std::cout << "\n";
};
}
/**
*
@ -44,8 +44,13 @@ auto printArray = [](int *arr, int sz) {
* the bottom up by successively sifting downward to establish the
* heap property.
*
* @param arr array to be sorted
* @param n size of array
* @param i node position in Binary Tress or element position in
* Array to be compared with it's childern
*
*/
void (*heapify)(int *arr, int n, int i) = [](int *arr, int n, int i) {
void heapify(int *arr, int n, int i) {
int largest = i;
int l = 2 * i + 1;
int r = 2 * i + 2;
@ -60,7 +65,7 @@ void (*heapify)(int *arr, int n, int i) = [](int *arr, int n, int i) {
std::swap(arr[i], arr[largest]);
heapify(arr, n, largest);
}
};
}
/**
* heapSort lambda function utilizes heapify procedure to sort
@ -70,14 +75,14 @@ void (*heapify)(int *arr, int n, int i) = [](int *arr, int n, int i) {
* @param n size of array
*
*/
auto heapSort = [](int *arr, int n) {
void heapSort(int *arr, int n) {
for (int i = n - 1; i >= 0; i--) heapify(arr, n, i);
for (int i = n - 1; i >= 0; i--) {
std::swap(arr[0], arr[i]);
heapify(arr, i, 0);
}
};
}
/** Main function */
int main() {