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

#include <iostream>
using namespace std;

void osszefesul(
    int t[], int bal, int kozep, int jobb)
{
    int ib = bal;
    int ij = kozep+1;

    int seged[1000];
    int n_seged = 0;

    while (ib <= kozep && ij <= jobb) {
        if (t[ib] <= t[ij]) {
            seged[n_seged] = t[ib];
            n_seged++;
            ib++;
        }
        else {
            seged[n_seged] = t[ij];
            n_seged++;
            ij++;
        }
    }

    while (ib <= kozep) {
        seged[n_seged] = t[ib];
        n_seged++;
        ib++;
    }

    while (ij <= jobb) {
        seged[n_seged] = t[ij];
        n_seged++;
        ij++;
    }

    for (int i = 0; i < n_seged; i++)
        t[bal+i] = seged[i];
}

void mergesort(int t[], int bal, int jobb)
{
    if (bal >= jobb)
        return;

    int kozep = (bal+jobb) / 2;

    mergesort(t, bal, kozep);
    mergesort(t, kozep+1, jobb);

    osszefesul(t, bal, kozep, jobb);
}


int main()
{
    int n = 7;
    int t[100] = {1, 5, 3, 0, 2, 7, 3};

    mergesort(t, 0, n-1);

    return 0;
}