Data-Structure-Programs/merge_sort.cpp at master · akshay2742/Data-Structure-Programs · 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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include<iostream>
using namespace std;
void merge(int *a, int l, int m, int r)
{
    int i,j,k;

    int n1=m-l+1;
    int n2=r-m;

    int L[n1];
    int R[n2];

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

    for ( j = 0; j < n2; j++)
    {
        R[j]=a[m+j+1];
    }

    i=0;
    j=0;
    k=l;
    while (i<n1 && j<n2)
    {
        if (L[i]<=R[j])
        {
            a[k]=L[i];
            i++;
        }
        else
        {
            a[k]=R[j];
            j++;
        }
        k++;


    }

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

    while (j<n2)
    {
        a[k]=R[j];
        j++;
        k++;
    }


}

void merge_sort(int *a,int l,int r)
{
    if(l<r)
    {
        int m=l+(r-l)/2;

        merge_sort(a,l,m);
        merge_sort(a,m+1,r);

        merge(a,l,m,r);
    }
}

int main()
{
    int arr[6];
    int i,j;

    cout<<"Enter the elements in the array: \n";
    for ( i = 0; i < 6; i++)
    {
        cin>>arr[i];
    }

    merge_sort(arr,0,5);

    cout<<"Sorted Array is: \n";

    for ( i = 0; i < 6; i++)
    {
        cout<<arr[i]<<" ";
    }


}