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)
(C) O(n log n)
Rewards per monthFirst Winner: 0 INR (Not Started)Second Winner: 0 INR (Not Started)
Show your Support. Become a FAN!