Assume you have two sorted arrays of equal size (n each), write a program to find...

Transcribed Image Text:

Assume you have two sorted arrays of equal size (n each), write a program to find the median in an array of size 2n, resulting from merging the two earlier arrays. Note that the median of a sorted numbers is the middle one in case of odd n and the average. of the middle two numbers when n is even. After merging both arrays, the size of the larger array will be 2n i.e. an even value. For this project let's assume n is odd. Solve the problem using: 1. Brute Force BF approach and provide the time and space complexity of your solution. How to enhance it? 2. Divide and Conquer D&C approach and provide the time and space complexity of your solution. Then, set up a recurrence relation for the algorithms basic operation and solve it. Assume you have two sorted arrays of equal size (n each), write a program to find the median in an array of size 2n, resulting from merging the two earlier arrays. Note that the median of a sorted numbers is the middle one in case of odd n and the average. of the middle two numbers when n is even. After merging both arrays, the size of the larger array will be 2n i.e. an even value. For this project let's assume n is odd. Solve the problem using: 1. Brute Force BF approach and provide the time and space complexity of your solution. How to enhance it? 2. Divide and Conquer D&C approach and provide the time and space complexity of your solution. Then, set up a recurrence relation for the algorithms basic operation and solve it.