Sail E0 Webinar
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?
Options:
A .  O(log n)
B .  O(n)
C .  O(n log n)
D .  O(n2)
Answer: Option B


-NA-



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos

Latest Test Papers