c++ programming questions: If a problem of size n requires time that is directly

Question

c++ programming questions:

If a problem of size n requires time that is directly proportional to n, the problem is _____ a) O(1) b) O(n) c) O(n^2) d) O(log_2 n) Which of the following growth-rate functions grows the fastest in value? a) 1 b) n c) n^2 d) log_2 n Which of the following growth-rate functions indicates a problem whose time requirement is independent of the size of the problem? a) 1 b) n c) 2^n d) log_2 n In the best case, a sequential search is _____. a) O(n) b) O(1) c) O(log_2 n) d) O(n^2) In the worst case, a binary search is _____. a) O(n) b) O(1) c) O(log_2 n) d) O(n^2)

Explanation / Answer

answer 9

if the problem is of size n and is directly propotional to size n then thre growth rate is O(n)

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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