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

9) For the given condition the big Oh complexity is O(n). Growth of running time is directly proportional to size of input.

10) n^2 grows the fastes in value in terms of time complexity.

11) For O(1), growth os running time is independent of size of input. As O(1) algorithms always executes in same time.

12) For sequential search best case will be O(1).

13) For binary search worst case complexity is O(logn).

Thank you.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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