Concept drill
selection sort
GATE CSE & IT · Sorting · 2006-2013
3
PYQs
100%
keyed
1
elite explanations
3
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →2013 PYQ
Which of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
easyanswer keyelite explanation
2009 PYQ
What is the number of swaps required to sort n elements using selection sort, in the worst case?
easyanswer key
2006 PYQ
Which one of the following in place sorting algorithms needs the minimum number of swaps?
easyanswer key