How to design an clogn time algorithm of 2 sorted array to find median of all 2N?

Asked Aug 21 '17 at 10:20

Active Aug 21 '17 at 10:20

Viewed 75 times

I have given a question that there is given two array A and B are sorted in ascending order. I need to design an clogn time algorithm to find the median of all 2N integers. The question noted that the N may not power of 2. Hint to solve the question is find min and max of both array then change the input and make length to power of 2.

My current problem: Since two array are sorted so the first element will be min and last element will be max for both arrays. Then here how can i change the input and make the length to power of 2?

asked Aug 21 '17 at 10:20

James

Why do you want to change the input? – biziclop Aug 21 '17 at 10:43
Because I want to make the length to power of 2 – James Aug 21 '17 at 11:55
@DAle u doesn't ans what I want. – James Aug 21 '17 at 11:56
2

Possible duplicate of [Design of an algorithm problems of Clog n\[C++ code\]](https://stackoverflow.com/questions/45691363/design-of-an-algorithm-problems-of-clog-nc-code) – Paul Hankin Aug 21 '17 at 13:30
You don't need to make the length a power of 2. – beaker Aug 21 '17 at 15:18
what means????? – James Aug 21 '17 at 15:49

How to design an clogn time algorithm of 2 sorted array to find median of all 2N?

0 Answers0