Data-Structure/merge_sort.cpp at master · DeekshaKodieur/Data-Structure · 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
#include<iostream>
using namespace std;


void merge_(int *a, int s, int e)
{
    int mid = (s+e)/2;

     int i=s;
     int j=mid+1;
     int k=s;

     int temp[100];

     while(i<=mid && j<=e)
     {
         if(a[i]<a[j])
         {
             temp[k]=a[i];
             i++;
         }
         else
         {
              temp[k]=a[j] ;
              j++;

         }
         k++;
     }

     while (i<=mid)
     {
         temp[k]=a[i];
         i++;
         k++;
     }

     while(j<=e)
     {
         temp[k]=a[j];
         j++;
         k++;
     }

     for( int i=s;i<=e;i++)
     {
         a[i]=temp[i];
     }


}


void merge_sort(int a[],int s, int e)
{
    if (s>=e)
    {
        return;
    }
    int mid = (s+e)/2;

    merge_sort(a,s,mid);
    merge_sort(a,mid+1,e);

    merge_(a,s,e);
}


int main()
{
    int a[100],n;
    cout<<"Total number of elements :    " ;
    cin>>n;
    cout<<endl;
    cout<<"Enter the elements : " <<endl;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }

    merge_sort(a,0,n-1);

    cout<<"Elements after merge sort : ";

    for(int i=0;i<n;i++)
    {

        cout<<a[i]<<" ";
    }

return 0;
}