Show that for any two bases a and b for logarithms, if a and b are both greater than 1, then
there is a constant c such that loga N ≤ c(logb N). Thus, there is no need to specify a base in
O(log N). That is, O(loga N) and O(logb N) mean the same thing.
I solved this problem,but I didn't understand this sentence .
Thus, there is no need to specify a base in
O(log N).
I don't think that the problem you specify has nothing to do with c++. Base in your case mean base of your logarithm:
ln has base e
log has base 10 etc