GATE Computer Science (CS) 2013 Solved Paper
© examsiri.com
Question : 16 of 65
Marks:
+1,
-0
Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
Go to Question: