常见的排序算法

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

---

提示：以下是本篇文章正文内容，下面案例可供参考

一、冒泡排序

//冒泡排序
    //没优化
    public static void bubbleSort(int[] array){
        for (int i = 0; i < array.length-1; i++) {
            for (int j = 0; j < array.length-1-i; j++) {
                if(array[i] > array[j]){
                    swap(array,i,j);
                }
            }
        }
    }
    //优化后
    public static void bubbleSort2(int[] array) {
        for (int i = 0; i < array.length - 1; i++) {
            boolean flg = true;
            for (int j = 0; j < array.length - 1 - i; j++) {
                if (array[j] > array[j + 1]) {
                    swap(array, j, j+1);
                    flg = true;
                }
            }
            if (flg = false) {
                break;
            }
        }
    }

二、选择排序

 //选择排序
    public static void main(String[] args) {
        int[] array = {12,5,18,10,4,2};
        selectSort(array);
        System.out.println(Arrays.toString(array));
    }
    public static void swap(int[] array,int i, int j){
        int tmp = array[i];
        array[i] = array[j];
        array[j] = tmp;
    }
    public static void selectSort(int[] array){
        for (int i = 0; i < array.length; i++) {
            for (int j = i+1; j < array.length; j++) {
                if(array[j] < array[i]){
                    swap(array,i,j);
                }
            }
        }
    }
    public static void selectSort1(int[] array){
        for (int i = 0; i < array.length; i++) {
            int minIndex = i;
            for (int j = i+1; j < array.length; j++) {
                if(array[j] < array[minIndex]){
                    minIndex = j;
                }
            }
            swap(array,i,minIndex);
        }
    }

三 、希尔排序

public static void main(String[] args) {
        int[] array = {12,5,18,10,4,2};
        shellSort(array);
        System.out.println(Arrays.toString(array));
    }

    public static void  shell(int[] array,int gap){
        for (int i = gap; i < array.length ; i++) {
            int tmp = array[i];
            int j = i - gap;
            for (; j >= 0; j -= gap) {
                if (array[j] > tmp) {
                    array[j + gap] = array[j];
                } else {
                    break;
                }
            }
            array[j + gap] = tmp;
        }
    }
    public static void shellSort(int[] array){
        int gap = array.length;
        while(gap > 1){
            shell(array,gap);
            gap /= 2;
        }
        shell(array,1);//保证是最后一组
    }

四、 堆排序

//堆排序
    public static void heapSort(int[] array){
        //1.建堆 O(N)
        creatHeap(array);
        int end = array.length-1;
        //交换然后调整
        while(end > 0){
            swap(array,0,end);
            shiftDown(array,0,end);
            end--;
        }
    }
    public static void shiftDown(int[] array,int parent,int len){
        int child = 2*parent+1;
        //最起码是由左孩子的，至少有一个孩子
        while (child < len) {
            if(child+1 < len && array[child] < array[child+1]){
                child++;//保证当前左右孩子最大值的标
            }
            if (array[child] > array[parent]) {
                swap(array,child,parent);
                /*int tmp = array[child];
                array[child] = array[parent];
                array[parent] = tmp;*/
                parent = child;
                child = parent*2+1;
            }else{
                break;
            }
        }
    }
    public static void creatHeap(int[] array){
        for (int parent = (array.length-1-1)/2; parent >= 0; parent--) {
            shiftDown(array,parent,array.length);
        }
    }

}

五、 快速排序

//快速排序
    public static void quickSort(int[] array){
        quick(array,0,array.length-1);
    }

    public static void inserSort2(int[] array,int start,int end) {
        for (int i = 1; i <= end; i++) {
            int tmp = array[i];
            int j = i - 1;
            for (; j >= start; j--) {
                if (array[j] > tmp) {
                    array[j + 1] = array[j];
                } else {
                    //array[j+k] = tmp;只要J回退的时候，遇到了 比tmp小的元素就技术这次比较
                    break;
                }
            }
            //j回退到了小于0的地方
            array[j + 1] = tmp;
        }
    }
    public static void quick(int[] array,int left,int right){
        if(left >= right){
            return;
        }
        //如果区间内的数据在排序过程中，小于某个范围了，可以使用直接插入排序
        if (right - left + 1 <= 1400) {
            //使用直接插入排序
            inserSort2(array,left,right);
            return;
        }
        //找基准之前，我们找到中间大小的值- 使用三数取中法
        int midValIndex = findMidValIndex(array,left,right);
        swap(array,midValIndex,left);
        
        int pivot = partition(array,left,right);//基准
        quick(array,left,pivot-1);
        quick(array,pivot+1,right);
    }

private static int findMidValIndex(int[] array,int start,int end){
        int mid = start + ((end-start) >>> 1);
        if(array[start] < array[end]){
            if(array[mid] < array[start]){
                return start;
            }else if(array[mid] > array[end]){
                return end;
            }else{
                return mid;
            }
        }else{
            if(array[mid] > array[start]){
                return start;
            }else if(array[mid] <array[end]){
                return end;
            }else{
                return mid;
            }
        }
    }
    public static int partition(int[] array,int start,int end) {
        int tmp = array[start];
        while (start < end) {
            while (start < end && array[end] >= tmp) {
                end--;
            }
            array[start] = array[end];
            while (start < end && array[start] <= tmp) {
                start++;
            }
            //start下标遇到了大于tmp的值
            array[end] = array[start];
        }
        array[start] = tmp;
        return start;
    }

 public static void quickSort2(int[] array){
        Stack<Integer> stack = new Stack<>();
        int left = 0;
        int right = array.length-1;
        int pivot = partition(array,left,right);
        if(pivot > left+1){
            //左边两个元素
            stack.push(left);
            stack.push(pivot-1);
        }
        if(pivot < right-1){
            //右边两个元素
            stack.push(pivot+1);
            stack.push(right);
        }
        while(!stack.isEmpty()){
            right = stack.pop();
            left = stack.pop();
           pivot =  partition(array,left,right);
           if(pivot > left+1){
               //左边两个元素
               stack.push(left);
               stack.push(pivot-1);
           }
           if(pivot < right-1){
               //右边两个元素
               stack.push(pivot+1);
               stack.push(right);
           }
        }
    }

六、 归并排序

public static int[] mergeArray(int[] array1,int[] array2){
        //注意判断参数
        int[] tmp = new int[array1.length+array2.length];
        int k = 0;
        int s1 = 0;
        int e1 = array1.length-1;
        int s2 = 0;
        int e2 = array2.length-1;
        while (s1 <= e1 && s2 <= e2) {
            if(array1[s1] <= array2[s2]){
                tmp[k++] = array1[s1++];
                //k++
                //s1++
            }else{
                tmp[k++] = array2[s2++];
            }
        }
        while (s1 <= e1) {
            tmp[k++] = array1[s1++];
        }
        while(s2 <= e2){
            tmp[k++] = array2[s2++];
        }
        return tmp;
    }

七、归并排序的递归实方式

public static void mergeSort(int[] array){
        mergeSortInternal(array,0,array.length-1);
    }
    private static void mergeSortInternal(int[] array,int low,int high){
        if(low >= high){
            return;
        }
        int mid = low + ((high - low) >>> 1);
        //右边
        mergeSortInternal(array,low,mid);
        //左边
        mergeSortInternal(array,mid+1,high);
        //合并
        merge(array,low,mid,high);
    }

    public static void merge(int[] array,int low,int mid,int high){
        int[] tmp = new int[high-low+1];
        int k = 0;
        int s1 = low;
        int e1 = mid;
        int s2 = mid +1;
        int e2 = high;
        while (s1 <= e1 && s2 <= e2) {
            if(array[s1] <= array[s2]){
                tmp[k++] = array[s1++];
                //k++
                //s1++
            }else{
                tmp[k++] = array[s2++];
            }
        }
        while (s1 <= e1) {
            tmp[k++] = array[s1++];
        }
        while(s2 <= e2){
            tmp[k++] = array[s2++];
        }
        //拷贝tmp数组的元素，放入原来的数组array当中
        for (int i = 0; i < k; i++) {
            array[i+low] = tmp[i];
        }
    }

    public static void main(String[] args) {
        int[] array = {1,8,4,5,9,78,56,45,8,22,36,82};
        mergeSort(array);
        System.out.println(Arrays.toString(array));
    }

八 、归并排序的非递归实现方式

public static void mergeSort1(int[] array){
        int nums = 1;//魅族的数据个数
        while(nums < array.length){
            //数组每次哦都要进行遍历，确定归并的区间
            for (int i = 0; i < array.length; i += nums*2) {
                int left = i;
                int mid = left + nums - 1;
                //防止越界
                if (mid >= array.length) {
                    mid = array.length-1;
                }
                int right = mid + nums;
                //防止越界
                if (right >= array.length) {
                    right = array.length-1;
                }
                //小标去欸的那个之后，进行合并
                merge(array,left,mid,right);
            }
            nums *= 2;
        }
    }


    public static void main(String[] args) {
        int[] array = {1,8,4,5,9,78,56,45,8,22,36,82};
        mergeSort1(array);
        System.out.println(Arrays.toString(array));
    }

九 、计数排序

 /**
     *计数排序
     * 适用于0-n个数据
     * @param array
     */

    public static void countingSort(int[] array) {
        int maxVal = array[0];
        int minVal = array[0];
        for (int i = 1; i < array.length; i++) {
            if (array[i] < minVal) {
                minVal = array[i];
            }
            if(array[i] > maxVal){
                maxVal = array[i] ;
            }
        }
        //说明已经找到了最大值和最小值
        int[] count = new int[maxVal - minVal+1];
        //统计array数组当中，每个数据出现的次数
        for (int i = 0; i < array.length; i++) {
            int index = array[i];
            count[index-minVal]++;
        }
        //说明在计数数组当中，已经把array数组档中，每个数据出现的次数已经统计好了
        //接下来，只需呀遍历计数数组，把数据写回array
        int indexArray = 0;
        for (int i = 0; i < count.length; i++) {
            while (count[i] > 0) {
                //这里一定要加minVal,因为不一定就是i出现了count[i]
                array[indexArray] = i + minVal;
                count[i]--;//拷贝一个之后，数据也就少一个
                indexArray++;//下标得向后移
            }
        }
    }