Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/mergesort_1_7.c

Created July 8, 2020 15:47
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/c67a35702377e906003d19f75627041f to your computer and use it in GitHub Desktop.
Save BMU-Verlag/c67a35702377e906003d19f75627041f to your computer and use it in GitHub Desktop.
Download ZIP
Raw
mergesort_1_7.c
for (i = 0; i < groesseBereich1; i++)
arr2[i] = arr[linkerRand + i];
for (j = groesseBereich1; j < groesseBereich1 + groesseBereich2; j++)
arr2[j] = arr[mitte + 1 + j – groesseBereich1];
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment