An array of 100 elements is to be sorted using the bubble sort in the modules (t

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 require at least one swap.

B) It will always require at least 99 comparisons

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

D) It will sometimes return (completely sorted) after only 99 data comparisons.

Explanation / Answer

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.

It will always require at least 99 comparisons.

Option b is correct choice.

Explanation :

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.