help!! This question assesses your understanding of what the O-notation communic

Question

help!!

This question assesses your understanding of what the O-notation communicates. Suppose you know that t(n) = O(n3). For each of the following statements, Indicate whether they (i) must be true, (ii) could be either true or false (depending what the function t(n) really is) or (iii) must be false. t(n) = n3 must be true could be either true or false must be false t(n) = O(n2) must be true could be either true or false must be false t(n) = n2 must be true could be either true or false must be false t(n) = O(n4) must be true could be either true or false must be false t(n) = n4 must be true could be either true or false must be false t(n) = O(t(n)) must be true could be either true or false must be false These two parts of the question assess your recollection of the asymtotic analysis of sorting algorithms we discussed in class.

Explanation / Answer

1 may be

2 may be

3 may be

4 false

5 false

6) must be

please rate 5

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

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