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


i have given question there given 2 array , b sorted in ascending order. need design clogn time algorithm find median of 2n integers. question noted n may not power of 2. hint solve question find min , max of both array change input , make length power of 2.

my current problem: since 2 array sorted first element min , last element max both arrays. here how can change input , make length power of 2?


Comments

Popular posts from this blog

sql - Time in datatime field -

javascript - How to split the success output from an Ajax post? -

java - sharing object across different classes -