Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/heapsort_1_7.c

Created July 8, 2020 12:24
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/96aaa585731615b54a53da9a857265f7 to your computer and use it in GitHub Desktop.
Save BMU-Verlag/96aaa585731615b54a53da9a857265f7 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
heapsort_1_7.c
int main() {
int arr[] = {5, 12, 18, 4, 6, 9};
int groesse = sizeof(arr) / sizeof(arr[0]);
heapSort(arr, groesse);
printf("Sortiertes Array:\n");
for (int i = 0; i < groesse; ++i){
printf("%d ", arr[i]);
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment