Last time on FABULOUS ADVENTURES: Eric Lippert: The second term is asymptotically insignificant compared to the first, so we'll throw it away, and declare that any sort on a list of n items has at least a worst case of O(n log n) comparisons. Leo McGarry:
Read More...