时髦的冒泡排序（Java Eclipse）

Question

我目前正在研究一个基本的冒泡排序，除了它使用 Comparable，并且因为我不确定在哪里实现它的功能而让我失望。

这是给定的，无法更改

public static <T extends Comparable<? super T>> void bubbleSort_Itr(T[] arr) { if(arr == null) throw new NullPointerException(); if(arr.length == 0) throw new IllegalArgumentException(); if(arr.length == 1) return; }

这是我在测试中创建的class

public class HubbaBubbaSort {

    public static <T extends Comparable<? super T>> void bubbleSort_Itr(T[] arr)
     {
        if(arr == null) throw new NullPointerException();
        if(arr.length == 0) throw new IllegalArgumentException();
        if(arr.length == 1) return;

        int n = arr.length; 
        for (int i = 0; i < n-1; i++) 
            for (int j = 0; j < n-i-1; j++) 
                if (arr[j] > arr[j+1]) 
                { 
                    // swap T temp and arr[i] 
                    T temp = arr[j]; 
                    arr[j] = arr[j+1]; 
                    arr[j+1] = temp; 
                    } 
     }
    /* Prints the array */
    void printArray(int arr[]) 
    { 
        int n = arr.length; 
        for (int i=0; i<n; ++i)
            System.out.print(arr[i] + " "); 
        System.out.println(); 
    } 

    // Driver method to test above 
    public static void main(String args[]) 
    { 
        HubbaBubbaSort ob = new HubbaBubbaSort(); 
        int arr[] = {64, 34, 25, 12, 22, 11, 90}; 
        ob.bubbleSort_Itr(arr); 
        System.out.println("Sorted array"); 
        ob.printArray(arr); 
    } 

}

Answer 1

这里的关键是Comparable接口：

https://docs.oracle.com/javase/8/docs/api/java/lang/Comparable.html

int compareTo(T o)

Parameters:
o - the object to be compared.

Returns:
a negative integer, zero, or a positive integer as this object is less than, 
equal to, or greater than the specified object.

一旦我们知道如何比较对象，我们就可以使用它来执行冒泡排序。此外，由于 int 是原始类型，无法实现 Comparable，因此我将其切换为 Integers。

public class HubbaBubbaSort {

    public static <T extends Comparable<? super T>> void bubbleSort_Itr(T[] arr) {
        if (arr == null)
            throw new NullPointerException();
        if (arr.length == 0)
            throw new IllegalArgumentException();
        if (arr.length == 1)
            return;

        int n = arr.length;
        for (int i = 0; i < n - 1; i++)
            for (int j = 0; j < n - i - 1; j++)

                if (arr[j].compareTo(arr[j + 1])>0) {
                    // swap T temp and arr[i]
                    T temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
    }

    /* Prints the array */
    void printArray(int arr[]) {
        int n = arr.length;
        for (int i = 0; i < n; ++i)
            System.out.print(arr[i] + " ");
        System.out.println();
    }

    // Driver method to test above
    public static void main(String args[]) {
        HubbaBubbaSort ob = new HubbaBubbaSort();
        Integer arr[] = { 64, 34, 25, 12, 22, 11, 90 };
        ob.bubbleSort_Itr(arr);
        System.out.println("Sorted array");
        System.out.println(Arrays.toString(arr));
    }
}

时髦的冒泡排序（Java Eclipse）

Funky Bubble Sort (Java Eclipse)

java

sorting

bubble-sort

comparable