From ca6337b3879b3baf0ce02edc309fd134a5d8d928 Mon Sep 17 00:00:00 2001
From: AltamasBari <altamasbari@gmail.com>
Date: Sat, 21 Dec 2019 23:48:00 +0530
Subject: [PATCH] Create meregesort.cpp

merge sort using c
---
 meregesort.cpp | 57 ++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 57 insertions(+)
 create mode 100644 meregesort.cpp

diff --git a/meregesort.cpp b/meregesort.cpp
new file mode 100644
index 0000000..ea2841e
--- /dev/null
+++ b/meregesort.cpp
@@ -0,0 +1,57 @@
+#include <stdio.h>
+#include <conio.h> 
+#define size 100
+void merge(int a[], int, int, int); 
+void merge_sort(int a[],int, int); 
+int main() {
+     int arr[size], i, n; 
+     printf("\n Enter the number of elements in the array : ");
+     scanf("%d", &n); printf("\n Enter the elements of the array: "); 
+     for(i=0;i<n;i++) { 
+         scanf("%d", &arr[i]);
+        } 
+     merge_sort(arr, 0, n-1);
+     printf("\n The sorted array is: \n"); 
+     for(i=0;i<n;i++) printf(" %d\t", arr[i]); 
+     getch(); 
+   }
+void merge(int arr[], int beg, int mid, int end) { 
+     int i=beg, j=mid+1, index=beg, temp[size], k;
+     while((i<=mid) && (j<=end)) { 
+         if(arr[i] < arr[j])  {  
+             temp[index] = arr[i];  
+	         i++; 
+     	   }
+         else  {  
+	         temp[index] = arr[j];  
+	         j++;
+           } 
+         index++; 
+       } 
+     if(i>mid) {  
+         while(j<=end) {
+             temp[index] = arr[j]; 
+             j++;  
+	         index++; 
+           } 
+       } 
+     else {  
+         while(i<=mid)  {   
+	         temp[index] = arr[i];  
+			 i++; 
+			 index++;  
+		   } 
+		} 
+	 for(k=beg;k<index;k++)
+	 arr[k] = temp[k]; 
+	} 
+void merge_sort(int arr[], int beg, int end) { 
+     int mid; 
+	 if(beg<end) {  
+	     mid = (beg+end)/2;  
+		 merge_sort(arr, beg, mid);  
+		 merge_sort(arr, mid+1, end);
+		 merge(arr, beg, mid, end);
+		}
+    }
+