Created
July 8, 2020 15:49
-
-
Save BMU-Verlag/7416b006cfa70e2589018d4877cafec8 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
void merge(int arr[], int arr2[], int linkerRand, int mitte, int rechterRand) | |
{ | |
int i, j, k; | |
int groesseBereich1 = mitte - linkerRand + 1; | |
int groesseBereich2 = rechterRand - mitte; | |
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]; | |
i = 0; | |
j = groesseBereich1; | |
k = linkerRand; | |
while (i < groesseBereich1 && j < groesseBereich1 + groesseBereich2) { | |
if (arr2[i] <= arr2[j]) { | |
arr[k] = arr2[i]; | |
i++; | |
} | |
else { | |
arr[k] = arr2[j]; | |
j++; | |
} | |
k++; | |
} | |
while (i < groesseBereich1) { | |
arr[k] = arr2[i]; | |
i++; | |
k++; | |
} | |
while (j < groesseBereich1 + groesseBereich2) { | |
arr[k] = arr2[j]; | |
j++; | |
k++; | |
} | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment