For a list of n elements, selection sort makes a number of passes equal to:
An minus 1
Bn plus 1
Cn times 2
Dn over 2
Answer & Solution
Correct answer: A. n minus 1
1. Each pass places one element permanently.
2. The last remaining element needs no pass.
3. So it makes n minus 1 passes.
_Source: syllabus Computer Science Class XII, Chapter 5, Sorting._
Keep practising Sorting Algorithms
Browse all Sorting Algorithms questions for Engineering — Tanzania, or explore more Computer Science topics.