From 809fc119cab81f4eed0306a6eeb896a2708f3cb7 Mon Sep 17 00:00:00 2001
From: Ayushi C <67193440+AyushiChakrabarty@users.noreply.github.com>
Date: Tue, 1 Sep 2020 22:54:42 +0530
Subject: [PATCH] Create Merge Sort in C++

---
 Merge Sort in C++ | 64 +++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 64 insertions(+)
 create mode 100644 Merge Sort in C++

diff --git a/Merge Sort in C++ b/Merge Sort in C++
new file mode 100644
index 0000000..9bff258
--- /dev/null
+++ b/Merge Sort in C++	
@@ -0,0 +1,64 @@
+//Merge sort in C++
+#include<iostream>
+using namespace std;
+
+void Merge(int *A, int *L, int lc,int *R,int rc) 
+{
+	int i=0;
+	int j=0;
+	int k=0;
+
+	while(i<lc && j< rc) 
+	{
+		if(L[i]  < R[j]) 
+		    A[k++] = L[i++];
+		else 
+		    A[k++] = R[j++];
+	}
+	while(i < lc) 
+	    A[k++] = L[i++];
+	while(j < rc) 
+	    A[k++] = R[j++];
+}
+
+// Sort an array of integers. 
+void MergeSort(int *A,int n) 
+{
+	int i,mid, *L, *R;
+	if(n < 2) 
+	    return;  
+
+	mid = n/2; 
+
+	L= new int[mid]; 
+	R= new int[n-mid]; 
+	
+	for(i = 0;i<mid;i++) 
+	    L[i] = A[i];
+	for(i = mid;i<n;i++) 
+	    R[i-mid] = A[i]; 
+
+	MergeSort(L,mid);  
+	MergeSort(R,n-mid);  
+	Merge(A,L,mid,R,n-mid); 
+        free(L);
+        free(R);
+}
+
+//Main function
+int main() 
+{
+	int A[20],n;
+	cout<<"Enter the size of the array you want to enter:"<<endl;
+	cin>>n;
+    cout<<"Enter the array elements:"<<endl;
+    
+    for(int i=0; i<n; i++)
+        cin>>A[i];
+        
+    MergeSort(A,n);
+
+	for(int i = 0;i <n; i++) 
+	    cout<<A[i]<<" ";
+	return 0;
+}