

MCQOPTIONS
Saved Bookmarks
1. |
Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort? |
A. | O(log n) |
B. | O(n) |
C. | O(n log n) |
D. | O(n2) |
Answer» C. O(n log n) | |