README.md

4. Median of Two Sorted Arrays

• The overall run time complexity should be O(log (m+n)).

One of the algorithms with logarithmic time complexity is binary search, and binary search can only be used with sorted lists. So we can use the binary search in this problem.