Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/mergesort_1_5.c

Created July 8, 2020 15:45
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/2af07507b22106d7cf475205c2485fd2 to your computer and use it in GitHub Desktop.
Save BMU-Verlag/2af07507b22106d7cf475205c2485fd2 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
mergesort_1_5.c
void mergeSort(int arr[], int arr2[], int linkerRand, int rechterRand)
{
if (linkerRand < rechterRand) {
int mitte = (linkerRand + rechterRand) / 2;
mergeSort(arr, arr2, linkerRand, mitte);
mergeSort(arr, arr2, mitte + 1, rechterRand);
merge(arr, arr2, linkerRand, mitte, rechterRand);
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment