algorithmDesign/Merge sort.cpp at main · mahidulhq/algorithmDesign · 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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include <iostream>
using namespace std;

void Merge(int A[], int l, int mid, int h)
{
    int a = mid - l + 1;
    int b = h - mid;
    int L[a], R[b];

    for (int i = 0; i < a; i++)
    {
        L[i] = A[l + i];
    }

    for (int j = 0; j < b; j++)
    {
        R[j] = A[mid + 1 + j];
    }

    int i = 0, j = 0, k = l;

    while (i < a && j < b)
    {
        if (L[i] <= R[j])
        {
            A[k] = L[i];
            i++;
        }
        else
        {
            A[k] = R[j];
            j++;
        }
        k++;
    }

    while (i < a)
    {
        A[k] = L[i];
        i++;
        k++;
    }

    while (j < b)
    {
        A[k] = R[j];
        j++;
        k++;
    }
}

void MS(int A[], int l, int h)
{
    if (l < h)
    {
        int mid = (l + h) / 2;
        MS(A, l, mid);
        MS(A, mid + 1, h);
        Merge(A, l, mid, h);
    }
}

int main()
{
    int n;
    cin >> n;

    int A[n];
    for (int i = 0; i < n; i++)
    {
        cin >> A[i];
    }

    MS(A, 0, n - 1);

    for (int i = 0; i < n; i++)
    {
        cout << A[i] << " ";
    }

    cout << endl;

    return 0;
}