java开发之排序算法

1.冒泡排序(从小到大排)

public class Sort {
    public void bubbleSort(int array[]) {
        int t = 0;
        for (int i = 0; i < array.length - 1; i++)
            for (int j = 0; j < array.length - 1 - i; j++)
                if (array[j] > array[j + 1]) {
                    t = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = t;
                }
            }
    public static void main(String[] args) {
        int[] array = { 37, 47, 23, 100, 19, 56, 56, 99, 9 };
        Sort st = new Sort();
         st.bubbleSort(array);
        System.out.println("排序后：" + Arrays.toString(array));
        }
    }

输出结果为

选择排序

public class Sort {
    public void selectSort(int array[]) {
            int t = 0;
            for (int i = 0; i < array.length - 1; i++){
                int index=i;
                for (int j = i + 1; j < array.length; j++)
                    if (array[index] > array[j])
                        index=j;
                if(index!=i){ //找到了比array[i]小的则与array[i]交换位置
                    t = array[i];
                    array[i] = array[index];
                    array[index] = t;
                }
            }
        }
     public static void main(String[] args) {
        int[] array = { 37, 47, 23, 100, 19, 56, 56, 99, 9 };
        Sort st = new Sort();
         st.selectSort(array);
        System.out.println("排序后：" + Arrays.toString(array));
        }   
  }  

输出结果：

插入排序

public class Sort {
    public void insertionSort(int array[]) {
            int i, j, t = 0;
            for (i = 1; i < array.length; i++) {
                t = array[i];
                for (j = i - 1; j >= 0 && t < array[j]; j--)
                    array[j + 1] = array[j];
                array[j + 1] = t;
            }
        }
    public static void main(String[] args) {
        int[] array = { 37, 47, 23, 100, 19, 56, 56, 99, 9 };
        Sort st = new Sort();
        st.insertionSort(array);
        System.out.println("排序后：" + Arrays.toString(array));
        }   
}

输出结果为

分治法快速排序

public class Sort {
    public void quickSort(int array[], int low, int high) {// 传入low=0，high=array.length-1;
            int pivot, p_pos, i, t;// pivot->位索引;p_pos->轴值。
            if (low < high) {
                p_pos = low;
                pivot = array[p_pos];
                for (i = low + 1; i <= high; i++)
                    if (array[i] > pivot) {
                        p_pos++;
                        t = array[p_pos];
                        array[p_pos] = array[i];
                        array[i] = t;
                    }
                t = array[low];
                array[low] = array[p_pos];
                array[p_pos] = t;
                // 分而治之
                quickSort(array, low, p_pos - 1);// 排序左半部分
                quickSort(array, p_pos + 1, high);// 排序右半部分
            }
        }
    public static void main(String[] args) {
        int[] array = { 37, 47, 23, 100, 19, 56, 56, 99, 9 };
        Sort st = new Sort();
       st.quickSort(array, 0, array.length - 1);
        System.out.println("排序后：" + Arrays.toString(array));
        }   

}

输出结果：

=================谢谢您的关注，后续会更新更多技术内容=========