The greatest number of pair comparisons you need to make during each loop is ____ than the number of elements in the array.
A)one less
B)one more
C)two less
D)two more

Question

Quizplus · Accepted Answer

In sorting algorithms that involve comparing elements, such as bubble sort, during each loop through the array, each element needs to be compared to its adjacent element to determine their correct order. Therefore, if there are n elements in the array, you will need to make n-1 comparisons (one less than the number of elements) because the last element does not have a next element to compare to during that loop.

The Greatest Number of Pair Comparisons You Need to Make