Re:Sorting a Billion Numbers with Julia
by adrianN on Tuesday March 22, 2016 @04:41AM
(#11335150)
It depends on the implementation. If you stuff your list in a (lazily constructed) heap, you can get the next element in O(log n) amortized.
[ Parent
| on HN ]
There are no comments on this comment yet.