The median of n elements can be found in O(n) time. Which one of the following…
PYQ GATE 2006
The median of n elements can be found in O(n) time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot?
- A.
Θ(n)
- B.
Θ(n log n)
- C.
Θ(n²)
- D.
Θ(n³)
Attempted by 705 students.
Sign up free to check your answer
Sign up freeLoading lesson…