fix: short a bit the code (sorting/merge_sort.cpp) (#1066)

* Merge_sort modified in while loop

* Merge_sort modified in while loop

* Merge_sort modified in while loop

* Update merge_sort.cpp
This commit is contained in:
@8848hg
2020-09-28 02:23:47 +05:30
committed by GitHub
parent 0196573949
commit 67be3a592d

View File

@@ -43,8 +43,8 @@ void merge(int *arr, int l, int m, int r) {
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
while (i < n1 || j < n2) {
if (j >= n2 || (i < n1 && L[i] <= R[j])) {
arr[k] = L[i];
i++;
} else {
@@ -54,18 +54,6 @@ void merge(int *arr, int l, int m, int r) {
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
delete[] L;
delete[] R;
}