{"id":16629,"date":"2023-06-01T06:35:12","date_gmt":"2023-06-01T06:35:12","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=16629"},"modified":"2023-06-01T07:18:53","modified_gmt":"2023-06-01T07:18:53","slug":"median-of-two-sorted-arrays-of-different-size-in-c","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/median-of-two-sorted-arrays-of-different-size-in-c\/","title":{"rendered":"Median of two Sorted Arrays of Different Size in C"},"content":{"rendered":"

\"\"<\/p>\n

The aim is to determine the median of two sorted arrays, a[] and b[], where N is the number of items in the first array and M is the number of elements in the second array. In this post, we will look at numerous techniques to solve this problem.<\/p>\n

Example 1:<\/strong><\/p>\n

Input format: arr1 = [1,4,7,10,12], arr2 = [2,3,6,15]<\/code><\/pre>\n
Output format<\/strong>:<\/p>\n
6.00000<\/code><\/pre>\n
Explanation:<\/strong>
\nCombine the two arrays. The final array is [1,2,3,4,6,7,10,12,15]. We know that the mid element is used to calculate the median. Because the element’s size is unusual. According to the formula, the median will be at the [(n+1)\/2]th place in the final sorted array. In this case, the median is at [(9+1)\/2]th place, which equals [5]th = 6.<\/p>\n
Example 2:<\/strong><\/p>\n
Input: arr1 = [1], arr2 = [2]<\/code><\/pre>\n
Output format:<\/strong> <\/p>\n
1.50000<\/code><\/pre>\n
Explanation:<\/strong>
\nCombine the two arrays. [1,2] is the final sorted array. We know that the mid element is used to calculate the median. Because the element’s size is consistent. The median is defined as the mean of the items in the [n\/2]th and [(n\/2)+1]th positions of the final sorted array. In this case, the median is (1+2)\/2 = 3\/2 = 1.50000.<\/p>\n
Method 1 : Merging two sorted arrays in a third array<\/h2>\n
The idea is to merge them into third array and there are two cases:<\/p>\n
Case 1:<\/strong> If the length of the third array is odd, then the median is at (length)\/2th index in the array obtained after merging both the arrays.<\/p>\n
Case 2:<\/strong> If the length of the third array is even, then the median will be the average of elements at index ((length)\/2 ) and ((length)\/2 \u2013 1) in the array obtained after merging both arrays.<\/p>\n
Algorithm to solve merging of two sorted arrays in a third array<\/h3>\n
    \n
  1. Merge the two given arrays into one array.<\/li>\n
  2. Then sort the third(merged) array<\/li>\n
  3. If the length of the third array is even then: <\/li>\n
  4. Divide the length of the array by 2. Return (arr[value]  + arr[value \u2013 1] \/ 2).<\/li>\n
  5. If the length of the third array is odd then: <\/li>\n
  6. Divide the length of the array by 2 and round that value and return the array[value]<\/li>\n<\/ol>\n
    Code implementation in C<\/h3>\n\t\t\t\t\t\t