Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

For each pair of functions f and g determine if f(n) ? O(g(n)), or f(n) ? ?(g(n)), or f(n) ? ?(g(n)). In order to receive

For each pair of functions f and g determine if f(n) ? O(g(n)), or f(n) ? ?(g(n)), or f(n) ? ?(g(n)).

In order to receive full credit, justify your answers. Example: f(n) = n 100 g(n) = n 200

In this case, we can see that both functions have the same linear growth. Thus, we know n 100 ? ?(n 200)

This could be shown with a limit and using LHopitals Rule: lim??? ? ?? ? 100 ?? ? 200 = lim??? ? 1 1 = 1

Since the result is a constant, this implies f(n) has the same order of growth as g(n). Thus: n 100 ? ?(n 200)

a. f(n) = n 2/3 g(n) = n 1/2

b. f(n) = log n + 100?n g(n) = (log n) 2 + n

c. f(n) = log 2n g(n) = log 3n

d. f(n) = n2 n g(n) = 3 n

e. f(n) = n! g(n) = 2 n

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

Practical Database Programming With Visual C# .NET

Authors: Ying Bai

1st Edition

0470467274, 978-0470467275

More Books

Students also viewed these Databases questions