Heap Sort
Heap Sort
#include <stdio.h>
if (largest != i) {
swap(&arr[i], &arr[largest]);
heapify(arr, n, largest);
}
}
int main() {
int n;
int arr[n];
printf("Enter elements:\n");
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
heapSort(arr, n);
return 0;
}