Why is the first one true, but the second one has the corrected formula = O(n^3)

Question

Why is the first one true, but the second one has the corrected formula = O(n^3)

The statements below show some features of "Big-Oh" notation for the functions f f(n) and g g(n). Determine whether each statement is TRUE or FALSE and correct the formula in the latter case. True/False Corrected O(n2 log n)

Explanation / Answer

1) Biggest term in first one is n^3. so O(f(n)) is true if f(n) is >= n^3 in first one it's given as O(n^4). since n^4 is >= n^3. It is true. 2) Biggest term in second one is n^3. so O(f(n)) is true if f(n) is >= n^3 in second one it's given as O(n^2 log(n)). n^2 log(n) is

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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