基础算法2——冒泡排序和快速排序

public class MyExchangeSort {
    // 冒泡排序
    public void BubbleExchangeSort(double[] sorted) {
        for (int i = 1; i < sorted.length; i++) {//进行排序次数为数组长度-1
            for (int j = 0; j < sorted.length - i; j++) {//从上到下进行排序，大数下沉
                if (sorted[j] > sorted[j + 1]) {
                    double temp = sorted[j];
                    sorted[j] = sorted[j + 1];
                    sorted[j + 1] = temp;
                }
            }
        }
    }
    public void BubbleExchangeSort1(double[] sorted) {
        for (int i = 1; i < sorted.length; i++) {
            for (int j = sorted.length; j > i+1; j--) {//从下到上进行排序，小数上浮
                if (sorted[j] < sorted[j - 1]) {
                    double temp = sorted[j];
                    sorted[j] = sorted[j - 1];
                    sorted[j - 1] = temp;
                }
            }
        }
    }
    // 快速排序
    public void QucikExchangeSort(double[] sorted, int low, int high) {
        if (low < high) {
            int pivot = findPivot(sorted, low, high);
            QucikExchangeSort(sorted, low, pivot - 1);
            QucikExchangeSort(sorted, pivot + 1, high);
        }
    }

    private int findPivot(double[] sorted, int low, int high) {
        // TODO Auto-generated method stub
        sorted[0] = sorted[low];
        while (low < high) {
            while (low < high && sorted[high] > sorted[0])
                high--;
            sorted[low] = sorted[high];
            while (low < high && sorted[low] < sorted[0])
                low++;
            sorted[high] = sorted[low];
        }
        sorted[low] = sorted[0];
        return low;
    }

}