From f58f4f1c3023f90d954037a12faca8e991274146 Mon Sep 17 00:00:00 2001
From: Dhruv kalra <81011668+Vipdhruvkalra@users.noreply.github.com>
Date: Mon, 10 Oct 2022 19:56:30 +0530
Subject: [PATCH 1/2] medianoftwosortedarrays.cpp

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

diff --git a/C++/medianoftwosortedarrays.cpp b/C++/medianoftwosortedarrays.cpp
new file mode 100644
index 0000000..3d77d04
--- /dev/null
+++ b/C++/medianoftwosortedarrays.cpp
@@ -0,0 +1,53 @@
+#include <bits/stdc++.h>
+using namespace std;
+ 
+int Solution(int arr[], int n)
+{
+  
+
+     if (n % 2 == 0)
+     {
+       int z = n / 2;
+       int e = arr[z];
+       int q = arr[z - 1];
+       int ans = (e + q) / 2;
+       return ans;
+     }
+    
+ 
+    else
+     {
+       int z = round(n / 2);
+       return arr[z];
+     }
+}
+ 
+
+int main() {
+    
+        int arr1[] = { -5, 3, 6, 12, 15 };
+        int arr2[] = { -12, -10, -6, -3, 4, 10 };
+ 
+        int i =  sizeof(arr1) / sizeof(arr1[0]);
+        int j =  sizeof(arr2) / sizeof(arr2[0]);
+ 
+        int arr3[i+j];
+        int l =  i+j;
+   
+        for(int k=0;k<i;k++)
+        {
+            arr3[k]=arr1[k];
+        }
+          
+        int a=0; 
+        for(int k=i;k<l;k++)
+        {
+            arr3[k]=arr2[a++];
+        }
+ 
+   
+        sort(arr3,arr3+l);
+ 
+     
+        cout<<"Median = " << Solution(arr3, l);
+}

From 04b88cfb6980070832fc2bbaffba48b90bf50404 Mon Sep 17 00:00:00 2001
From: Dhruv kalra <81011668+Vipdhruvkalra@users.noreply.github.com>
Date: Mon, 10 Oct 2022 22:22:44 +0530
Subject: [PATCH 2/2] Delete medianoftwosortedarrays.cpp

---
 C++/medianoftwosortedarrays.cpp | 53 ---------------------------------
 1 file changed, 53 deletions(-)
 delete mode 100644 C++/medianoftwosortedarrays.cpp

diff --git a/C++/medianoftwosortedarrays.cpp b/C++/medianoftwosortedarrays.cpp
deleted file mode 100644
index 3d77d04..0000000
--- a/C++/medianoftwosortedarrays.cpp
+++ /dev/null
@@ -1,53 +0,0 @@
-#include <bits/stdc++.h>
-using namespace std;
- 
-int Solution(int arr[], int n)
-{
-  
-
-     if (n % 2 == 0)
-     {
-       int z = n / 2;
-       int e = arr[z];
-       int q = arr[z - 1];
-       int ans = (e + q) / 2;
-       return ans;
-     }
-    
- 
-    else
-     {
-       int z = round(n / 2);
-       return arr[z];
-     }
-}
- 
-
-int main() {
-    
-        int arr1[] = { -5, 3, 6, 12, 15 };
-        int arr2[] = { -12, -10, -6, -3, 4, 10 };
- 
-        int i =  sizeof(arr1) / sizeof(arr1[0]);
-        int j =  sizeof(arr2) / sizeof(arr2[0]);
- 
-        int arr3[i+j];
-        int l =  i+j;
-   
-        for(int k=0;k<i;k++)
-        {
-            arr3[k]=arr1[k];
-        }
-          
-        int a=0; 
-        for(int k=i;k<l;k++)
-        {
-            arr3[k]=arr2[a++];
-        }
- 
-   
-        sort(arr3,arr3+l);
- 
-     
-        cout<<"Median = " << Solution(arr3, l);
-}