Java方式实现常用的排序算法

冒泡排序

public class BubbleSort extends AbstractSort {

    @Override
    public void sort(int[] a) {
        if (a == null || a.length < 2) {
            return;
        }
        int len = a.length;
        for (int i = 0; i < len - 1; i++) {
            for (int j = i + 1; j < len; j++) {
                if (a[i] > a[j]) {
                    swap(a, i, j);
                }
            }
        }
    }

    public static void main(String[] args) {
        BubbleSort sorter = new BubbleSort();
        int[] a = sorter.mockArray(10, 500);
        System.out.println(Arrays.toString(a));
        System.out.println("************** Bubble Sort **************");
        sorter.sort(a);
        System.out.println(Arrays.toString(a));
    }
}

---

快速排序

public class QuickSort extends AbstractSort {

    @Override
    public void sort(int[] a) {
        if (a != null && a.length > 1) {
            quickSort(a, 0, a.length - 1);
        }
    }

    private void quickSort(int[] a, int left, int right) {
        if (left < right) {
            int pivot = partition(a, left, right);
            quickSort(a, left, pivot - 1);
            quickSort(a, pivot + 1, right);
        }
    }

    private int partition(int[] a, int left, int right) {
        int pivot = a[left];
        while (left < right) {
            while (left < right && a[right] >= a[left]) {
                right --;
            }
            a[left] = a[right];
            while (left < right && a[left] <= a[right]) {
                left ++;
            }
            a[right] = a[left];
        }
        a[left] = pivot;
        return left;
    }

    public static void main(String[] args) {
        QuickSort sorter = new QuickSort();
        int[] a = sorter.mockArray(10, 1000);
        System.out.println(Arrays.toString(a));
        System.out.println("************* Quick Sort *************");
        sorter.sort(a);
        System.out.println(Arrays.toString(a));
    }

}

---

归并排序

public class MergeSort extends AbstractSort {

    @Override
    public void sort(int[] a) {
        if (a != null && a.length > 1) {
            int[] temp = new int[a.length];
            mergeSort(a, 0, a.length - 1, temp);
        }
    }

    private void mergeSort(int[] a, int left, int right, int[] temp) {
        if (left == right) {
            return;
        }
        int mid = (left + right) / 2;
        mergeSort(a, left, mid, temp);
        mergeSort(a, mid + 1, right, temp);
        merge(a, left, right, mid, temp);
    }

    private void merge(int[] a, int left, int right, int mid, int[] temp) {
        // TODO - copy elements to temp 
        for (int i = left; i < right + 1; i++) {
            temp[i] = a[i];
        }
        // TODO - sort (by double pointer)
        int i = left;
        int j = mid + 1;
        for (int k = left; k < right + 1; k++) {
            if (i == mid + 1) {
                a[k] = temp[j];
                j ++;
            } else if (j == right + 1 || temp[i] < temp[j]) {
                a[k] = temp[i];
                i++;
            } else {
                a[k] = temp[j];
                j ++;
            }
        }
    }

    public static void main(String[] args) {
        MergeSort sorter = new MergeSort();
        int[] a = sorter.mockArray(10, 1000);
        System.out.println(Arrays.toString(a));
        System.out.println("************* Merge Sort *************");
        sorter.sort(a);
        System.out.println(Arrays.toString(a));
    }

}