Merge Sort is not outputting correct numbers

[leo255]

Hello,

The current code is outputting the wrong numbers (It is copying the first and last numbers, and skipping some in between). Wondering if you guys see what I'm doing wrong.

My Output:

2
2
6
10
10

Thanks!

#include <iostream>

using namespace std;

void merge(int arr[], int size, int low, int middle, int high){

int temp[size];

for (int i = 0; i <= high; i++){

temp[i] = arr[i];

}

int i = low;
int j = middle+1;
int k = low;

while (i <= middle && j <= high){
if (temp[i] <= temp[j]){
arr[k] = temp[j];
i++;
}
else{
arr[k] = temp[j];
j++;
}
k++;
}
while(i <= middle){
arr[k] = temp[i];
k++;
i++;
}

}

void mergeSort(int arr[], int size, int low, int high){

if (low < high){
int middle = (low + high) / 2;
mergeSort(arr, size, low, middle);
mergeSort(arr, size, middle+1, high);
merge(arr, size, low, middle, high);

}
}
int main()
{
    
    int arr[5] = {5, 10, 1, 6, 2};
 mergeSort(arr, 5, 0, 4);   
 
 for (int i = 0; i < 5; i++)
 cout << arr[i] << endl;
 
   return 0;
}

[dhayden]

Lines 21 and 25 do the same thing. Should line 21 be arr[k] = temp[i]?

[DeathLeap]

Did what dhayden said, the output is:

1
2
5
6
10

[leo255]

Been busy with work. Thank you, dhayden!!