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 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
Get step-by-step solutions from verified subject matter experts
