Question
Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
Answer: Option B
Was this answer helpful ?
-NA-
Was this answer helpful ?
Submit Solution