Answered step by step
Verified Expert Solution
Question
1 Approved Answer
(2 points) When we say an algorithm is O(log n) (or even O(log n)) we are allowed to be sloppy about the base of the
(2 points) When we say an algorithm is O(log n) (or even O(log n)) we are allowed to be sloppy about the base of the logarithm. Why is this ok? We are looking for mathematical reasoning in this
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