Algorithum Analysis Please choose one of the following choices for Questions 1,2

Question

Algorithum Analysis

Please choose one of the following choices for Questions 1,2 and 3. ( Addtional Proof would be perfect, Thank you)

What is the tightest bound possible (from the possible choices) for f(n)?

f(n) = n*log(n^2) + n

Question 1 Choices:

1) O( (n^2) * log n )

O(n^2)

3) O(n log n)

O(2^n)

O(n)

*************************************************

What is the tightest bound possible (from the possible choices) for f(n)?

f(n) = 20000^2 + n *log(n) + n

Question 2 Choices:

O(n log n)

O(n)

O(2^n)

O( (n^2) * log n )

O(n^2)

******************************************

What is the tightest bound possible (from the possible choices) for f(n)?

f(n) = n^(3/2) + n^(3/2)

Question 3 options:

O( (n^2) * log n )

O(n log n)

O(2^n)

O(n)

O(n^2)

******************************************************************

1) O( (n^2) * log n )

O(n^2)

3) O(n log n)

O(2^n)

O(n)

Explanation / Answer

1)  O(n log n)

2) O(n log n)

3) O(n^2)

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.