...
Question 3509 – 2017 November NTA UGC NET Paper 1
February 13, 2024
Question 9848 – Time-Complexity
February 13, 2024
Question 3509 – 2017 November NTA UGC NET Paper 1
February 13, 2024
Question 9848 – Time-Complexity
February 13, 2024

Question 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: 
A
Θ(n logn)
B
Θ(n)
C
Θ(n2)
D
Θ(n√n)
E
Both (A) and (C)
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!