Communication
February 13, 2024GATE 2000
February 13, 2024GATE 1990
|
Question 13
|
Choose the correct alternatives (More than one may be correct).
The complexity of comparison based sorting algorithms is:
|
Θ(n logn)
|
|
|
Θ(n)
|
|
|
Θ(n2)
|
|
|
Θ(n√n)
|
|
|
Both (A) and (C)
|
Question 13 Explanation:
Correct Answer: E
Question 13 Explanation: