Question: (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

(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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!