Question: When analysing the logarithmic complexity of an algorithm, the base of the logarithm can be ignored, for example instead of saying O(log2(n)), where log2 is
When analysing the logarithmic complexity of an algorithm, the base of the logarithm can be ignored, for example instead of saying O(log2(n)), where log2 is the log of base 2, we can say O(log(n)). Is this statement correct? Explain your answer.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
