DSA_and_Cpp_Program/merge_sort.cpp at master · Pankaj29Shah/DSA_and_Cpp_Program · 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
#include<iostream>
using namespace std;
void merge_two(int arr[],int s,int mid,int e)
{
    int l=((e-s)+1);
    int ar[l];
    int i=s,j=mid+1;
    int x=0;
    for(;(i<=mid)&&(j<=e);x++)
    {
        if(arr[i]<=arr[j])
        {
            ar[x]=arr[i];
            i++;
        }
        else
        {
            ar[x]=arr[j];
            j++;
        }
    }
    if(i>mid)
    {
        for(;j<=e;x++)
        {
            ar[x]=arr[j];
            j++;
        }
    }
    else
    {
        for(;i<=mid;x++)
        {
            ar[x]=arr[i];
            i++;
        }
    }
    for(int p=0;p<l;p++)
    {
        arr[s]=ar[p];
        s++;
    }
}
void merge(int arr[],int s,int e)
{
    if(e<=s)
    {
        return;
    }
    int mid=(s+e)/2;
    merge(arr,s,mid);
    merge(arr,mid+1,e);
    merge_two(arr,s,mid,e);
}
int main()
{
    int m;
    cin>>m;
    int arr[m];
    for(int i=0;i<m;i++)
    {
        cin>>arr[i];
    }
    cout<<endl;
    cout<<endl;
    merge(arr,0,m);
    for(int i=0;i<m;i++)
    {
       cout<<arr[i]<<" ";
    }
    return 0;
}