4.MedianofTwoSortedArray.cpp

//Name ;- Pushkar Roy
//Date :- 05-10-2022

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
       for(int i=0; i<nums2.size(); i++)
       {
           nums1.push_back(nums2[i]);
       }
        sort(nums1.begin(),nums1.end());
        if(nums1.size()%2 == 0)
        {
            return (double(nums1[nums1.size()/2-1] + nums1[nums1.size()/2]))/2;
        }
        else
        {
              return float(nums1[nums1.size()/2]);
        }
    }
};