Question 3509 – 2017 November NTA UGC NET Paper 1
February 13, 2024Question 9848 – Time-Complexity
February 13, 2024Question 10562 – Time-Complexity
Choose the correct alternatives (More than one may be correct).
The complexity of comparison based sorting algorithms is:
Correct Answer: E
Question 8 Explanation:
Θ(n logn)
Θ(n)
Θ(n2)
Θ(n√n)
Both (A) and (C)
Subscribe
Login
0 Comments