##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Given two sorted arrays and , return the median of the combined sorted array. The solution must run in time.
This is LeetCode , one of the oldest hard problems. The logarithmic requirement rules out merging the arrays. You need binary search, but not on the arrays directly.
