Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/quick_sort_1_1.c

Created May 26, 2020 07:59
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/7097908e20529bd73c1dc0993a4c93e5 to your computer and use it in GitHub Desktop.
Save BMU-Verlag/7097908e20529bd73c1dc0993a4c93e5 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
quick_sort_1_1.c
void quickSort(int liste[], int links, int rechts)
{
if (links < rechts - 1)
{
int trenner = teilen(liste, links, rechts);
quickSort(liste, links, trenner - 1);
quickSort(liste, trenner + 1, rechts);
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment