A closer look at the complexity analysis of finding the k’th smallest element in two sorted arrays

https://blogs.msdn.microsoft.com/oldnewthing/20171023-00/?p=97266 [blogs.msdn.microsoft.com]

2017-10-24 16:03

Given two sorted arrays of the same length, with unique elements, find the kth smallest element in the combined collection. One solution involves the double binary search. I’ll let you go read the article to see how it works. I’m here to dissect the complexity analysis.