Data-Structures-and-Algorithms/Sorting_Algorithms/Merge_Sort.cpp at 6996ab6c68f084ac385fcb8db2bed0c8cc95b37b · codemistic/Data-Structures-and-Algorithms · 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
#include <bits/stdc++.h>
using namespace std;
void mergeSort(int arr[], int n);
void Merge(int left[], int right[], int arr[], int x, int y,int n);
void printArray(int arr[], int n);
int main()
{
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
    mergeSort(arr, n);
    printArray(arr,n);
}
void mergeSort(int arr[], int n)
{
    if (n < 2)
    {
        return;
    }
    int mid = n / 2;
    int left[mid];
    int right[n - mid];
    for (int i = 0; i < mid; i++)
    {
        left[i] = arr[i];
    }
    for (int i = mid; i < n; i++)
    {
        right[i - mid] = arr[i];
    }
    mergeSort(left, mid);
    mergeSort(right, n - mid);
    Merge(left, right, arr, mid, n - mid,n);
}
void Merge(int left[], int right[], int arr[], int x, int y,int n)
{
    int i = 0, j = 0, k = 0;
    while (i < x && j < y)
    {
        if (left[i] <= right[j])
        {
            arr[k] = left[i];
            i++;
        }
        else
        {
            arr[k] = right[j];
            j++;
        }
        k++;
    }
    while (i < x)
    {
        arr[k] = left[i];
        i++;
        k++;
    }
    while (j < y)
    {
        arr[k] = right[j];
        j++;
        k++;
    }
}
void printArray(int arr[], int n)
{
    for (int i = 0; i < n; i++)
    {
        cout << arr[i] << " ";
    }
    cout << endl;
}