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(nLogn
D. O(n^2)
Answer» C. O(nLogn


Discussion

No Comment Found

Related MCQs