Bug Fix heap sort [Fresh Implementation]

This commit is contained in:
Ayaan Khan 2020-06-21 00:06:04 +05:30
parent 549daeebfd
commit 38db7fdec0

View File

@ -44,9 +44,7 @@ auto printArray = [] (int *arr, int sz) {
* The heapify procedure can be thought of as building a heap from * The heapify procedure can be thought of as building a heap from
* the bottom up by successively sifting downward to establish the * the bottom up by successively sifting downward to establish the
* heap property. * heap property.
* *
* @param arr array be to sorted
* @param
*/ */
void(*heapify)(int *arr, int n, int i) = [] (int *arr, int n, int i) { void(*heapify)(int *arr, int n, int i) = [] (int *arr, int n, int i) {
int largest = i; int largest = i;