In the worst case,the insertion sort's comparison occurs ______ times.
A)n
B)n - 1
C)(n - 1)/ 2
D)n * (n - 1)/2

Question

Quizplus · Accepted Answer

In the worst-case scenario, each element needs to be compared to every element before it for the entire length of the array. This means that for an array of length n, the number of comparisons is equivalent to the sum of the first n-1 integers, which is equal to n*(n-1)/2. Therefore, choice D is the correct answer.

In the Worst Case,the Insertion Sort's Comparison Occurs ______ Times