Re:A Gentle Introduction to Algorithm Complexity Analysis
by leif on Thursday July 05, 2012 @01:52AM
(#4201890)
In terms of just the expression, yes, you just count the largest term. In cases where you count more closely, it's either in the constant (quicksort vs mergesort) or in terms of removing randomness or amortization.
[ Parent
| on HN ]
There are no comments on this comment yet.