n should go to infinity in Big-O analysis not 2^31. (wrong ?)
if considering n < 2^31 in Big-O analysis, then O(log2(n) is also "effectively constant"
if constant factor matters in Big-O analysis, then 5 "effectively constant" operations becomes logarithmic. So does translating a logarithmic operation from Python to Java
Article
Notes
The author acknowledges the following things are true
O(log32(n))
time2^31
.The author argues the "Effectively Constant" claim is incorrect
O(log32(n)
isO(0.2log32(n))
isO(log2(n))
n
should go to infinity in Big-O analysis not2^31
. (wrong ?)n < 2^31
in Big-O analysis, thenO(log2(n)
is also "effectively constant"