DataStructures/mergeSort.cpp at main · manishk-99/DataStructures · 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
#include <bits/stdc++.h>
using namespace std;


void merge(int A[], int L[], int l1, int R[], int r1) {
    int i=0,j=0,k=0;
    while(i<l1 && j<r1) {
        if(L[i]<=R[j]) {
            A[k]=L[i];
            i++;
        } else {
            A[k] = R[j];
            j++;
        }
        k++;
    }
    while(i<l1) {
        A[k] = L[i];
        k++;
        i++;
    }
    while(j<r1) {
        A[k] = R[j];
        k++;
        j++;
    }
}

void mergeSort(int A[], int n) {
    if(n<2) {
        return;
    }
    int mid = n/2;
    int L[mid],R[n-mid];
    for(int i=0;i<mid;i++) {
        L[i] = A[i];
    }
    for(int i=mid;i<n;i++) {
        R[i-mid] = A[i];
    }
    mergeSort(L, mid);
    mergeSort(R, n-mid);
    merge(A,L,mid,R,n-mid);
}

int main() {
    int n = 6;
    int A[6] = {12, 11, 13, 5, 6, 7};
    mergeSort(A, n);
    for(int i=0;i<n;i++) {
        cout<<A[i]<<endl;
    }
}