GATEverse
← GATE CSE 2013

Q6

MCQ1 mark, −0.33

Which one of the following is the tightest upper bound that represents the number of swaps required to sort nn numbers using selection sort?

Sign in to save attempts.

Loading…