In this video, I will show you how to find the kth smallest element in two sorted arrays of length n and m in O(log n + log m) time. This generalizes the problem of finding the median.
- Жыл бұрын
Finding the kth Smallest Elements of Two Sorted Arrays
- Рет қаралды 797
Пікірлер: 3