What is the number of swaps required to sort n elements using selection sort,…
GATE · 2009 · CS
What is the number of swaps required to sort n elements using selection sort, in the worst case?
- A.
Θ(n)
- B.
Θ(n log n)
- C.
Θ(n²)
- D.
Θ(n² log n)
Attempted by 1435 students.
Sign up free to check your answer
Sign up freeLoading lesson…