Correct answer: (B) $T=O(\sqrt n)$ and $T=\Omega(1)$
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort
More Asymptotic Analysis and Time/Space Complexity questions
GATE 2026 CS (CS1) Q17– Consider the following recurrence relations: For all n > 1: T 1(n) = 4T 1(n/2) + T 2(n) T…
GATE 2026 CS (CS1) Q47– Let G(V, E) be a simple, undirected graph. A vertex cover of G is a subset V' V such that…
GATE 2026 CS (CS2) Q24– Consider the following functions, where n is a positive integer: n1/3, n, (n!), and 2 n.…
GATE 2026 CS (CS2) Q25– Which of the following can be recurrence relation(s) corresponding to an algorithm with…
GATE 2026 CS (CS2) Q38– Consider an array A of integers of size n with indices from 1 to n. An algorithm is to be…
GATE 2025 CS (CS1) Q20– Consider the following recurrence relation: T(n) = 2T(n-1) + n2n for n > 0, T(0) = 1.…