Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/mergesort_1_8.c

Created July 8, 2020 15:48
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/0e589a3ac90d3881ee393e367b7aaf87 to your computer and use it in GitHub Desktop.
Save BMU-Verlag/0e589a3ac90d3881ee393e367b7aaf87 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
mergesort_1_8.c
while (i < groesseBereich1 && j < groesseBereich1 + groesseBereich2) {
if (arr2[i] <= arr2[j]) {
arr[k] = arr2[i];
i++;
}
else {
arr[k] = arr2[j];
j++;
}
k++;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment