# GATE Papers >> CSE >> 2013 >> Question No 6

Question No. 6

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