Given two sorted arrays nums1 and nums2 of size m and n respectively, find the median of the two sorted arrays. The overall time complexity should be O(log(m + n)). Write an pseudo code to solve this problem. Also explain how complexity of pseudo code is O(log(m+n)).

Answer rating: 100% (QA)

The detailed ... View the full answer