How many comparisons does selection sort make when sorting an array of length n? A)log(2ⁿ) B)n C)n( n + 1) / 2

Question

Quizplus · Accepted Answer

Selection sort makes n(n - 1)/2 comparisons for sorting an array of length n. This is because for each element, it compares it with each of the other elements to find the minimum (or maximum) for the current position. This results in n-1 comparisons for the first element, n-2 for the second, and so on, down to 1 comparison for the second-to-last element. The sum of this series is n(n - 1)/2.

How Many Comparisons Does Selection Sort Make When Sorting an Array