From 25a34b39267a91e43f61c2fc0306c8a04187557b Mon Sep 17 00:00:00 2001
From: Akshat Jain <68468062+Aj12345616@users.noreply.github.com>
Date: Sun, 2 Oct 2022 18:27:14 +0530
Subject: [PATCH] Add files via upload

Median of two sorted array using C++
---
 Median of two sorted array.cpp | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 Median of two sorted array.cpp

diff --git a/Median of two sorted array.cpp b/Median of two sorted array.cpp
new file mode 100644
index 0000000..0c44043
--- /dev/null
+++ b/Median of two sorted array.cpp	
@@ -0,0 +1,30 @@
+double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
+        int n1=nums1.size();
+        int n2=nums2.size();
+        if(n2<n1) return findMedianSortedArrays(nums2,nums1);
+        
+        int low=0,high=n1;
+        while(low<=high){
+            int cut1=(high+low)/2;
+            int cut2=(n1+n2+1)/2-cut1;
+            
+            int left1=cut1==0?INT_MIN:nums1[cut1-1];
+            int left2=cut2==0?INT_MIN:nums2[cut2-1];
+            
+            int right1=cut1==n1?INT_MAX:nums1[cut1];
+            int right2=cut2==n2?INT_MAX:nums2[cut2];
+            
+            if(left1<=right2 && left2<=right1){
+                if((n1+n2)%2==0){
+                    return (max(left1,left2)+min(right1,right2))/2.0;
+                }else{
+                    return max(left1,left2);
+                }
+            }else if(left1>right2){
+                high=cut1-1;
+            }else{
+                low=cut1+1;
+            }
+        }
+        return 0.0;
+    }