From 4e1f0012b527b1e815fa51c460b20cc57b707fb4 Mon Sep 17 00:00:00 2001
From: Mohit-Kukreja-2002
 <93993902+Mohit-Kukreja-2002@users.noreply.github.com>
Date: Sun, 2 Oct 2022 15:58:27 +0530
Subject: [PATCH] Create MergeSort.cpp

---
 MergeSort.cpp | 53 +++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 MergeSort.cpp

diff --git a/MergeSort.cpp b/MergeSort.cpp
new file mode 100644
index 0000000..5d0e13e
--- /dev/null
+++ b/MergeSort.cpp
@@ -0,0 +1,53 @@
+void MergeSort(int arr[],int start,int end){
+    if(start>=end){
+        return;
+    }
+
+    int mid=start+(end-start)/2;
+
+    MergeSort(arr,start,mid);
+    MergeSort(arr,mid+1,end);
+
+    merge(arr,start,end);
+}
+
+void merge(*arr,int s,int e){
+    int mid=s+(e-s)/2;
+
+    int length1=mid-s+1;
+    int length2=e-mid;
+
+    int *firstpart=new int[length1];
+    int *secondpart=new int[length2];
+
+    int k=s;
+    for(int i=0;i<length1;i++){
+        firstpart[i]=arr[k++];
+    }
+    for(int i=0;i<length2;i++){
+        second[i]=arr[k++];
+    }
+
+    int i=0;
+    int j=0;
+    int mainArrayIndex=s;
+
+    while(i<length1 && j<length2){
+        if(firstpart[i]<secondpart[j]){
+            arr[mainArrayIndex++] = firstpart[i++];
+        }
+        else{
+            arr[mainArrayIndex++] = secondpart[j++];
+        }
+    }
+
+    while(i<length1){
+        arr[mainArrayIndex++] = firstpart[i++];
+    }
+    while(j<length2){
+        arr[mainArrayIndex++] = secondpart[j++];
+    }
+
+    delete [] firstpart;
+    delete [] secondpart;
+}