Question

Make the bubble sort end if it makes a complete pass through the elements to be sorted that doesn’t make any swaps. Demonstrate that it works using SortDriver.java.

(Hint: You can’t easily make a for loop end early. So you will want to convert the outermost for loop to a while, so that it can terminate early.

Hint 2: You will need a variable to keep track of whether any swaps have been performed this time, and it needs to be declared outside the while loop so that you can use it in the while loop test.)

Here is my code so far:

public class SortingAndSearching {
public static <T extends Comparable<T>> void swap(T[] data, int ind1,int ind2)
{
T temp = data[ind1];
data[ind1]=data[ind2];
data[ind2] = temp;
}
public static <T extends Comparable<T>>
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);
}
  
}
}
}

Answer 1

public class SortingAndSearching {
    public static <T extends Comparable<T>> void swap(T[] data, int ind1, int ind2) {
        T temp = data[ind1];
        data[ind1] = data[ind2];
        data[ind2] = temp;
    }

    public static <T extends Comparable<T>>
    void bubbleSort(T[] data) {
        int position, scan, count;
        for (position = data.length - 1; position >= 0; position--) {
            count = 0;
            for (scan = 0; scan <= position - 1; scan++) {
                if (data[scan].compareTo(data[scan + 1]) > 0) {
                    swap(data, scan, scan + 1);
                    count++;
                }
            }
            if(count == 0) break;
        }
    }
}