Answered step by step
Verified Expert Solution
Link Copied!

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

image text in transcribed

(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

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Machine Performance Modeling Methodologies And Evaluation Strategies Lncs 257

Authors: Francesca Cesarini ,Silvio Salza

1st Edition

3540179429, 978-3540179429

Students also viewed these Databases questions