Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/heapsort_1_4.c

Created July 8, 2020 12:23
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/3adb7df60b08f75c1e07e97ca04e6c53 to your computer and use it in GitHub Desktop.
Save BMU-Verlag/3adb7df60b08f75c1e07e97ca04e6c53 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
heapsort_1_4.c
int groesstesElement = position;
int links = 2 * position + 1;
int rechts = 2 * position + 2;
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment