To find the median of an unsorted array, we can make a min-heap in O(nlogn) time for n elements, and then we can extract one by one n/2 elements to get the median. But this approach would take O(nlogn) time.To find the median of an unsorted array, we can
阅读背景：
找到未排序数组的中位数
来源：互联网
分享到：
