Re:Big-O Algorithm Complexity Cheat Sheet
by ot on Saturday May 04, 2013 @05:38PM
(#5656405)
> changing base is a constant factor.
Only if the base is constant. For example B-trees have O(log_B n)-time operations, and you can't ignore the B because it is a parameter (hence non-constant).
Only if the base is constant. For example B-trees have O(log_B n)-time operations, and you can't ignore the B because it is a parameter (hence non-constant).