The

bubble sort

algorithm is less efficient than it could be. If a pass

is made through the list without exchanging any elements, this means that the list

is sorted and there is no reason to continue. Modify this algorithm so that it will

stop as soon as it recognizes that the list is sorted. NO BREAK STATEMENT!

-------------------------

(java code that needs to be modified, only a few lines need to be added)

public static

extends

Comparable >

void

bubbleSort(T[ ] data)

{

int

position, scan;

T temp;

for

(position = data.length-1; position >= 0; position--)

{

for

(scan = 0; scan <= position-1

; scan++)

{

if

(data[scan].compareTo(data[scan+1]) > 0)

swap(data, scan, scan+1);

}

}

}