For a list of length n, insertion sort makes ____ key comparisons, in the worst case. A) n(n - 1)/4 B) n(n - 1)/2 C) n² D) n³

Name: For a list of length n, insertion sort makes ____ key comparisons, in the worst case. A) n(n - 1)/4 B) n(n - 1)/2 C) n 2 D) n 3
Brand: Quizplus
Rating: 4.8 (35 reviews)

Question

Quizplus · Accepted Answer

In the worst case, each element needs to be compared with every other element before finding its correct position. Therefore, the total number of comparisons in the worst case would be (n-1) + (n-2) + ... + 2 + 1, which is equal to n(n-1)/2.

For a List of Length N, Insertion Sort Makes ____