Question 9704 – Time-Complexity
February 13, 2024Question 9527 – Time-Complexity
February 13, 2024Question 9517 – Time-Complexity
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of
Correct Answer: C
Question 19 Explanation:
In comparison based sorting, the tightest bound of number of comparisons is θ(n log n).
→ Tightest upper bound is (big O).
Tightest lower bound is (big Ω).
→ Tightest upper bound is (big O).
Tightest lower bound is (big Ω).
n
n2
nlogn
nlog2n
Subscribe
Login
0 Comments