DataStructerAlgorithms/MergeSort.cpp at main · umutsar/DataStructerAlgorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
void merge(int dizi[], int left, int mid, int right)
{
    int n1 = mid - left + 1;
    int n2 = right - mid;

    int L[n1], R[n2];

    for (int i = 0; i < n1; i++)
    {
        L[i] = dizi[left + i];
    }
    for (int j = 0; j < n2; j++)
    {
        R[j] = dizi[mid + 1 + j];
    }

    int i = 0, j = 0, k = left;
    while (i < n1 && j < n2)
    {
        if (L[i] <= R[j])
        {
            dizi[k] = L[i];
            i++;
        }
        else
        {
            dizi[k] = R[j];
            j++;
        }
        k++;
    }
    while (i < n1)
    {
        dizi[k] = L[i];
        i++;
        k++;
    }
    while (j < n2)
    {
        dizi[k] = R[j];
        j++;
        k++;
    }
}

void mergeSort(int dizi[], int left, int right)
{
    if (left < right)
    {
        int mid = left + (right - left) / 2;
        mergeSort(dizi, left, mid);
        mergeSort(dizi, mid + 1, right);
        merge(dizi, left, mid, right);
    }
}

// Usage: mergeSort(dizi, 0, size - 1);