From 6aff653195d8dd8e470e57c68228798a09eaeb8f Mon Sep 17 00:00:00 2001 From: Naman Garg Date: Fri, 1 Oct 2021 20:42:38 +0530 Subject: [PATCH] Added Merge Sort program in C++ --- merge-sort.cpp | 79 ++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 79 insertions(+) create mode 100644 merge-sort.cpp diff --git a/merge-sort.cpp b/merge-sort.cpp new file mode 100644 index 0000000..73a9ef2 --- /dev/null +++ b/merge-sort.cpp @@ -0,0 +1,79 @@ +/* +Program to sort the array using merge sort + +code by iamkakashi +*/ +#include +using namespace std; +void merge(int a[], int l, int m, int r) + { + + int n=max(a[m],a[r])+1; + int i=l,j=m+1,k=l; + while(i<=m && j<=r && k<=r){ + int e=a[i]%n; + int e1=a[j]%n; + if(e<=e1){ + a[k]+=e*n; + k++; + i++; + } + else{ + a[k]+=e1*n; + k++; + j++; + } + } + while(i<=m){ + int e=a[i]%n; + a[k]+=e*n; + k++; + i++; + } + while(j<=r){ + int e1=a[j]%n; + a[k]+=e1*n; + k++; + j++; + } + for(int i=l;i<=r;i++){ + a[i]=a[i]/n; + } + } + void mergeSort(int a[], int l, int r) + { + + + if(l>n; + int arr[n+1]; + cout<<"Enter elements: "; + for(i=0;i>arr[i]; + } + mergeSort(arr, 0, n-1); + cout<<"Sorted array is: "; + printArray(arr, n); + + return 0; +} \ No newline at end of file