diff --git a/cpp/Gunjan_MergeSort.cpp b/cpp/Gunjan_MergeSort.cpp
new file mode 100644
index 0000000..5071e76
--- /dev/null
+++ b/cpp/Gunjan_MergeSort.cpp
@@ -0,0 +1,53 @@
+#include <iostream>
+using namespace std;
+
+ void merge(int a[],int s,int e){
+         int mid=(s+e)/2;
+         int i=s;
+         int j=mid+1;
+         int k=s;
+         
+         int temp[100];
+    while(i<=mid && j<=e){
+         if(a[i]<a[j]){
+             temp[k++]=a[i++];
+         }
+         else{
+             temp[k++]=a[j++];
+         }
+    }
+    while(i<=mid){
+           temp[k++]=a[i++];
+    }
+    while(j<=e){
+        temp[k++]=a[j++];
+    }
+      
+      for(int i=s;i<=e;i++){
+          a[i]=temp[i];
+      }
+    
+ }
+void mergesort(int a[],int s,int e){
+      if(s>=e){
+          return;
+      }
+         int mid=(s+e)/2;
+         mergesort(a,s,mid);
+         mergesort(a,mid+1,e);
+         merge(a,s,e);
+}
+int main() {
+
+         int a[100];
+         int n;
+         cin>>n;
+         for(int i=0;i<n;i++){
+             cin>>a[i];
+         }
+         mergesort(a,0,n-1);
+         for(int i=0;i<n;i++){
+             cout<<a[i]<<" ";
+         }
+    return 0;
+}