An array of 100 elements is to be sorted using the bubble sort in the modules (the one that tests the return value of floatLargestToTop() to see if it can return "early&quo…

Question

An array of 100 elements is to be

sorted using the bubble sort in the
modules (the one that tests the return value of
floatLargestToTop() to see if it can return
"early".) Check all the true statements about the sort algorithm,
i.e., the sort method and its support methods. (Check all
that apply.)

a. It will always return (completely sorted) after 99 data comparisons.
b. It will sometimes return (completely sorted) after only 99 data comparisons.
c. It will always require at least one swap.
d. It will always require at least 99 comparisons

Answer 1

It will always return (completely sorted) after 99 data comparisons.

It will always require at least 99 comparisons

Step-by-step explanation: