I have got an array containing unique elements. I need to find out the first n largest elements in the array in the least complexity possible. The solution that I could think of so far has a complexity of O(n^2).I have got an array containing unique elements.
阅读背景：
在数组中找到第一个n个最大的元素。
来源：互联网
分享到：
