logoalt Hacker News

ComplexSystems • today at 3:12 AM • 0 replies • view on HN

Roughly speaking, O(n log n) means "grows no faster than k(n log n) for some k", whereas o(n log n) means grows strictly more slowly* than k(n log n) for all* choices of k.