News for hackers. Stuff that matters.
Re:Pattern-defeating quicksort by beagle3 on Friday June 30, 2017 @04:26AM (#14669336)
Simple binary tree is O(n^2) just like a linked list.

Unless you know what you know your distributions and are generally proficient in probability theory (in 99% of the cases, neither can be relied on) the only relevant big-O metric is the worst case one

There are no comments on this comment yet.