Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/heapsort_1_5.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/cc0c093c343beff7f147d139fe49a842 to your computer and use it in GitHub Desktop.
Save BMU-Verlag/cc0c093c343beff7f147d139fe49a842 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
heapsort_1_5.c
if (links < groesse && arr[links] > arr[groesstesElement]){
groesstesElement = links;
}
if (rechts < groesse && arr[rechts] > arr[groesstesElement]){
groesstesElement = rechts;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment