Skip to content

Merge sort algorithm added #78

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
codewithdev merged 1 commit into from
Oct 5, 2020
+35 −0
Merged

Merge sort algorithm added #78

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
35 changes: 35 additions & 0 deletions 04-Sorting/MergeSort.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
/*
* Merge sort algorithm works on divide and conquer concept
* This code shows divide and conquer steps in two different functions separately
*/
#include<iostream>
#include<vector>
using namespace std;

void merging(vector<int> &ar,int low,int mid,int high){
int I=low,J=mid+1,K=0,br[10000];
while(I<=mid && J<=high) br[K++] = ar[I]<=ar[J] ? ar[I++] : ar[J++];
while(I<=mid) br[K++]=ar[I++];
while(J<=high) br[K++]=ar[J++];
while(--K>=0) ar[low+K]=br[K];
}

void merg_sort(vector<int> &ar,int low,int high){
if(low<high){
int mid = (low+high)/2;
merg_sort(ar,low,mid);
merg_sort(ar,mid+1,high);
merging(ar,low,mid,high);
}
}

int main(){
int n;
cin >> n;
vector<int> ar(n);
for(int I=0;I<n;I++) cin >> ar[I];

merg_sort(ar,0,n-1);
for(int I=0;I<n;I++) cout << ar[I] << " ";
return 0;
}