coding-blocks-Assignment/mergesortByRecursion.cpp at main · ksaini-web/coding-blocks-Assignment · 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
#include<iostream>
#include<vector>
using namespace std;

 void merge(vector<int>&arr,int st,int mid,int end){

    vector<int>temp;

    int i=st,j=mid+1;

    while(i<=mid&&j<=end){

        if(arr[i]<=arr[j]){

            temp.push_back(arr[i]);
            i++;
        }

        else{
            temp.push_back(arr[j]);
            j++;
        }
    }

    while(i<=mid){
        temp.push_back(arr[i]);
        i++;
    }

      while(j<=end){
        temp.push_back(arr[j]);
        j++;
    }
    for(int idx=0;idx<temp.size();idx++){

        arr[idx+st]=temp[idx];
    }
 }

void  mergesort(vector<int>&arr,int st,int end){

    int mid=st+(end-st)/2;
    if(st >= end) return;

// for left half

    mergesort(arr,st,mid);
    mergesort(arr,mid+1,end);

    merge(arr,st,mid,end);


}
int main(){

    vector<int> arr={12,31,35,8,32};

    mergesort(arr,0,arr.size()-1);

    for(int val:arr){
        cout<<val<<" ";

    }
    cout<<endl;

    return 0;
}