Question

To sort a list having n elements, the Selection sort makes .......... number of passes through the list.

• A. \(n^2\)
• B. \(n\)
• C. \(n-1\)
• D. \(n+1\)

Hint:

Selection sort is an in-place sorting algorithm that minimizes the number of swaps by selecting the minimum element in each pass.

Answer 1

The Correct Option is C

In the selection sort algorithm, the number of passes required is \(n-1\) because in each pass the algorithm selects the smallest (or largest) element from the unsorted portion of the list and places it in its correct position. Therefore, \(n-1\) passes are needed to sort the list.