Consider a problem of size n for which a recursive algorithm divides this…
Consider a problem of size n for which a recursive algorithm divides this problem into 3 subproblems of size n/2, to do this, algorithm takes linear amount of time. Which of the following is the tightest upper bound for the time complexity for such algorithm.
- A.
O(n logn)
- B.
O(n)
- C.
O(n2)
- D.
None of the above
Attempted by 130 students.
Sign up free to check your answer
Sign up freeLoading lesson…