5 months ago
Day 53 - Advanced DSA : Searching 2: Binary Search Problems --Home Work Q2. Median of Array Problem Description There are two sorted arrays A and B of sizes N and M respectively. Find the median of the two sorted arrays ( The median of the array formed by merging both the arrays ). NOTE: The overall run time complexity should be O(log(m+n)). IF the number of elements in the merged array is even, then the median is the average of (n/2)th and (n/2+1)th element. For example, if the array is [1 2 3 4], the median is (2 + 3) / 2.0 = 2.5. Problem Constraints 1 <= N + M <= 2*106 Input Format The first argument is an integer array A of size N. The second argument is an integer array B of size M. Output Format Return a decimal value denoting the median of two sorted arrays. Example Input Input 1: A = [1, 4, 5] B = [2, 3] Input 2: A = [1, 2, 3] B =  Example Output Output 1: 3.0 Output 2: 2.5 Example Explanation Explanation 1: The median of both the sorted arrays will be 3.0. Explanation 2: The median of both the sorted arrays will be (2+3)/2 = 2.5.