![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
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. | Θ(n2) |
D. | Θ(n2 log n) |
Answer» A. Θ(n) |
View all MCQs in
Data Structure and Algorithms (DSA)No comments yet