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
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Genomes Browsers And Databases Data Mining Tools For Integrated Genomic Databases
Authors: Peter Schattner
1st Edition
0521711320, 978-0521711326
