Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

How would I prove that log 2 (3 2n ) = O(n) (Big Oh of N) I got: 2 log 2 (3) n

How would I prove that log2(32n) = O(n) (Big Oh of N)

I got: 2 log2(3) n <= c * n , however, I do not know how to continue from this part.

Thanks

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

Big Data Concepts, Theories, And Applications

Authors: Shui Yu, Song Guo

1st Edition

3319277634, 9783319277639

More Books

Students also viewed these Databases questions

Question

What are the eight types of intelligence? (p. 65)

Answered: 1 week ago