Re:Twitter Sort
by statusgraph on Tuesday January 13, 2015 @08:44PM
(#8883782)
Not quite. Big-O creates an -upper bound-. It could be the upper bound of the best case, the average, or the worst case. (So, for example, one can say quicksort has worst case performance O(n^2) but an expected performance of O(n log n))
[ Parent
| on HN ]
There are no comments on this comment yet.