Create Median of Two Sorted Arrays

Arrays/C++/Median of Two Sorted Arrays

@@ -0,0 +1,34 @@
+Median of Two Sorted Arrays
+
+
+
+// Brute Force:
+               // 1.Merge Both Array
+              // 2.Sort them
+             // 3.Find Median
+            // TIME COMPLEXITY: O(n)+O(nlogn)+O(n)
+            // SPACE COMPLEXITY: O(1)
+
+class Solution {
+public:
+    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
+       // Initialization some neccessary variables
+        vector<int>v;
+
+        // store the array in the new array
+        for(auto num:nums1)   // O(n1)
+            v.push_back(num);
+
+        for(auto num:nums2)  // O(n2)
+            v.push_back(num);
+
+        // Sort the array to find the median
+        sort(v.begin(),v.end());  // O(nlogn)
+
+        // Find the median and Return it
+        int n=v.size();  // O(n)
+
+        return n%2?v[n/2]:(v[n/2-1]+v[n/2])/2.0;
+    }
+};
+