Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/heapsort_1_3.c

Created July 8, 2020 12:22
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save BMU-Verlag/adac6175f54e2e5274d306c3a6770980 to your computer and use it in GitHub Desktop.
Save BMU-Verlag/adac6175f54e2e5274d306c3a6770980 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
heapsort_1_3.c
void heapSort(int arr[], int groesse) {
for (int i = groesse / 2 - 1; i >= 0; i--){
heapify(arr, groesse, i);
}
for (int i = groesse - 1; i >= 0; i--){
int tausch = arr[i];
arr[i] = arr[0];
arr[0] = tausch;
heapify(arr, i, 0);
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment