From a038e6bc3cb64363ce96b833f44a436528cb8cbc Mon Sep 17 00:00:00 2001
From: Gargi Yadav <gargiyadav1699@gmail.com>
Date: Mon, 8 Oct 2018 12:40:58 +0530
Subject: [PATCH 1/2] Update README.md

---
 README.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/README.md b/README.md
index 06ba005..1ac3074 100644
--- a/README.md
+++ b/README.md
@@ -356,6 +356,10 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
 
 # G
 
+### Gargi
+- I am an Undergraduate .
+- I like competitive programming. 
+
 ### Gerlis A.C  :computer: (@gerlis18)
 - I am from Colombia.
 - I am a junior developer Java, Javascript, HTML.

From ac9ab817cc0280669ff14d1447392cedf0ac9e0f Mon Sep 17 00:00:00 2001
From: gargi16 <gargiyadav1699@gmail.com>
Date: Mon, 8 Oct 2018 13:07:14 +0530
Subject: [PATCH 2/2] file added

---
 code/mergeSort.cpp | 60 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 code/mergeSort.cpp

diff --git a/code/mergeSort.cpp b/code/mergeSort.cpp
new file mode 100644
index 0000000..3750274
--- /dev/null
+++ b/code/mergeSort.cpp
@@ -0,0 +1,60 @@
+#include<bits/stdc++.h>
+using namespace std ;
+
+void merge(int arr[], int l, int m , int r){
+	int n1 = m-l+1;
+	int n2 = r-m ;
+	int L[n1];
+	int R[n2];
+	for (int i = 0; i < n1; i++)
+        L[i] = arr[l + i];
+    for (int j = 0; j < n2; j++)
+        R[j] = arr[m + 1+ j];
+	int i =0, j= 0 , k=l ;
+	while(i<n1 && j<n2){
+		if(L[i]<R[j]){
+			arr[k]= L[i];
+			i++;
+		}
+		else{
+			arr[k]= R[j];
+			j++;
+		}
+		k++;
+	}
+	while(i<n1){
+		arr[k] = L[i];
+		i++;k++;
+	}
+	while(j<n2){
+		arr[k]= R[j];
+		j++;k++;
+	}
+	
+}
+void mergeSort(int arr[], int l, int r){
+	if(l<r){
+		int m = l+ (r-l)/2 ;
+		mergeSort(arr,l, m);
+		mergeSort(arr,m+1,r);
+		
+		merge(arr, l,m,r);
+	}
+}
+void printArray(int A[], int size)
+{
+    int i;
+    for (i=0; i < size; i++)
+        printf("%d ", A[i]);
+    printf("\n");
+}
+
+
+int main() {
+	int arr[]= {7,5,11,13,6,12};
+	printArray(arr,6);
+	mergeSort(arr,0,5);
+	printArray(arr, 6);
+	
+	return 0;	
+}