java 八大排序算法

最新推荐文章于 2024-06-05 19:09:50 发布

ᴡᴀᴋᴜ⌓‿⌓ᴡᴀᴋᴜ

最新推荐文章于 2024-06-05 19:09:50 发布

阅读量87

点赞数

分类专栏： GXM的数据结构与算法学习日志文章标签： java 排序算法算法

本文链接：https://blog.csdn.net/qq_43726119/article/details/128221710

版权

GXM的数据结构与算法学习日志专栏收录该内容

35 篇文章 0 订阅

订阅专栏

1.bubble sort

package com.gxmedu.sort;
import java.util.Arrays;
public class BubbleSort {
    public static void main(String[] args) {
        int[] arr = {1,92,37,16,28,12};
        System.out.println( Arrays.toString(arr));
        bubbleSort(arr);
        System.out.println( Arrays.toString(arr));
    }
    public static void bubbleSort(int[] arr){
        int length =arr.length;
        boolean flag = false;
        for (int i = 0; i < length - 1 ; i++) {
            for (int j = 0; j < length - 1 - i ; j++) {
                if(arr[j] > arr[j + 1]){
                    flag = true;
                    arr[j] += arr[j + 1];
                    arr[j + 1] = arr[j] - arr[j + 1];
                    arr[j] -= arr[j + 1];
                }
            }
            if(flag == false){
                break;
            }else{
                flag = false;
            }
        }
    }
}

2.select sort

package com.gxmedu.sort;
import java.util.Arrays;
public class SelectSort {
    public static void main(String[] args) {
        int[] arr = {1,92,37,16,28,12};
        System.out.println( Arrays.toString(arr));
        selectSorting(arr);
        System.out.println( Arrays.toString(arr));
    }
    public static void selectSorting(int[] arr){
        int length = arr.length;
        for (int i = 0; i < length - 1; i++) {
            int min = arr[i];
            int minIndex = i;
            for (int j = i + 1; j < length; j++) {
                if(min > arr[j] ){
                    minIndex = j;
                    min = arr[j];
                }
            }
            if(minIndex != i){
                arr[minIndex] = arr[i];
                arr[i] = min;
            }
        }
    }
}

3.insert sort

package com.gxmedu.sort;
import java.util.Arrays;
public class InsertionSorting {
    public static void main(String[] args) {
        int[] arr = {1,92,37,16,28,12};
        System.out.println( Arrays.toString(arr));
        insertionSort(arr);
        System.out.println( Arrays.toString(arr));
    }
    public static void insertionSort(int[] arr){
        int length = arr.length;
        for (int i = 1; i < length; i++) {
            int insertValue = arr[i];
            int insertIndex = i - 1;
            while(insertIndex >= 0 && insertValue < arr[insertIndex]){
                arr[insertIndex + 1] = arr[insertIndex--];
            }
            arr[insertIndex + 1] = insertValue;
        }
    }
}

4.shell sort

package com.gxmedu.sort;
import java.util.Arrays;
public class ShellSort {
    public static void main(String[] args) {
//        int[] arr = {1,92,37,16,28,12,7,6,4,5,-1,-18};
        int length = 8000000;
        int[] arr = new int[length];
        for (int i = 0; i < length ; i++) {
            arr[i] = (int)(Math.random()*800000);
        }
//        System.out.println( Arrays.toString(arr));
        long start = System.currentTimeMillis();
        shellSort(arr);
//        System.out.println( Arrays.toString(arr));
        long end = System.currentTimeMillis();
        System.out.println("花费毫秒：" + (end - start));

    }
    public static void shellSort(int[] arr){
        int length = arr.length;
        for(int gap = length / 2;gap > 0;gap /= 2 ){
            for(int i = gap; i < length;i++){
                int insertValue = arr[i];
                int insertIndex = i - gap;
                while(insertIndex >= 0 && insertValue < arr[insertIndex]){
                    arr[insertIndex + gap] = arr[insertIndex];
                    insertIndex = insertIndex - gap;
                }
                arr[insertIndex + gap] = insertValue;
//                for (int j = i - gap; j >= 0 ; j -= gap) {
/*                我这里将insertValue理解错了，其实index大的才是要insert的value
                    int insertValue = arr[i - gap];
                    int insertIndex = i - gap;
                    while(insertIndex >= 0 && insertValue < arr[insertIndex]){
                        arr[insertIndex + gap] = arr[insertIndex];
                        insertIndex -= gap;
                    }
                    arr[insertIndex + gap] = insertValue;
 */
//                }
            }
        }
    }
}

5.quick sort

package com.gxmedu.sort;

import java.util.Arrays;

/**
 * @author 郭学明
 * @version 1.0
 */
public class QuickSort {
    public static void main(String[] args) {
//                int[] arr = {1,92,37,16,28,12,7,6,4,5,-1,-18};
        int length = 8000000;
        int[] arr = new int[length];
        for (int i = 0; i < length ; i++) {
            arr[i] = (int)(Math.random()*800000);
        }
//        System.out.println( Arrays.toString(arr));
        long start = System.currentTimeMillis();
        quickSort(arr,0,arr.length - 1);
//        System.out.println( Arrays.toString(arr));
        long end = System.currentTimeMillis();
        System.out.println("花费毫秒：" + (end - start));
    }
    public static void quickSort(int[] arr,int start ,int end) {
        if (start < end) {
            int pivot = arr[start];
            int left = start;
            int right = end;
            while (left < right) {
//            从右边开始找，直到找到一个小于pivot的数停下来，停下来以后，将这个值赋给arr[left]
                while (left < right && arr[right] >= pivot) {
                    right--;
                }
                arr[left] = arr[right];
                while (left < right && arr[left] <= pivot) {
                    left++;
                }
                arr[right] = arr[left];
            }
//        if(left == right){
            arr[left] = pivot;
//        }
            quickSort(arr,start,left);
            quickSort(arr,right + 1,end);
        }
    }
}

6.merge sort

package com.gxmedu.sort;

import java.util.Arrays;

/**
 * @author 郭学明
 * @version 1.0
 */
public class MergeSort {
    public static void main(String[] args) {
//        int[] arr = {1,92,37,16,28,12,7,6,4,5,-1,-18};
        int length = 8000000;
        int[] arr = new int[length];
        for (int i = 0; i < length ; i++) {
            arr[i] = (int)(Math.random()*800000);
        }
//        System.out.println( Arrays.toString(arr));
        int[] temp = new int[length];
        long start = System.currentTimeMillis();
        mergeSort(arr,0,arr.length - 1,temp);
//        System.out.println( Arrays.toString(arr));
        long end = System.currentTimeMillis();
        System.out.println("花费毫秒：" + (end - start));
    }
    public static void mergeSort(int[] arr,int left,int right,int[] temp){
        if (left < right) {
            int mid = (left + right) / 2;
//            int[] temp = new int[arr.length];
            mergeSort(arr,left,mid,temp);
            mergeSort(arr,mid + 1,right,temp);
            merge(arr,left,right,mid,temp);
        }
    }
    public static void merge(int[] arr,int left,int right,int mid,int[] temp){
        /**
         *  第一步将两个有序数组的数依次两两比较，直至一个数组的数都比较完
         */
        int i = left;
        int j = mid + 1;
        int t = 0;
        while(i <= mid && j <= right ){
            if(arr[i] <= arr[j]){
                temp[t++] = arr[i++];
            }else{
                temp[t++] = arr[j++];
            }
        }
        /**
         *  将剩下一个未比较完的数组全部放入临时数组内
         */
        while(i <= mid){
            temp[t++] = arr[i++];
        }
        while(j <= right){
            temp[t++] = arr[j++];
        }
        /**
         * 将临时数组的值赋给待排序数组
         */
        t = 0;
        for (int k = left; k <= right ; k++,t++) {
            arr[k] = temp[t];
        }
    }
}

7.radix sort

package com.gxmedu.sort;

import java.util.Arrays;

/**
 * @author 郭学明
 * @version 1.0
 */
public class RadixSort {
    public static void main(String[] args) {
        int[] arr = {1,92,37,16,28,1423,100,11,12,7,6,4,5};
        radixSort(arr);
        System.out.println( "基数排序如下\n" + Arrays.toString(arr));
    }
    public static void radixSort(int[] arr){
        /**
         *  先把第一轮桶排序写出来，然后再外面加入循环。
         *  需要找到最大值的位数来确定桶排序的轮数
         */
        int max = arr[0];
        int length = arr.length;
        for (int i = 0; i < length; i++) {
            if(max < arr[i]){
                max = arr[i];
            }
        }
        int round = (max + "").length(); 
        int[][] bucket = new int[10][length];
        int[] bucketElementCount = new int[length];
        for (int t = 0,n = 1; t < round ; t++,n *= 10) {
            for (int i = 0; i < length; i++) {
                int bucketNum = arr[i] / n % 10;
                //            int sequence = bucketElementCount[bucketNum];
                bucket[bucketNum][bucketElementCount[bucketNum]++] = arr[i];
            }
            int index = 0;
            for (int i = 0; i < 10; i++) {
                if(bucketElementCount[i] == 0){
                    continue;
                }
                for (int j = 0; j < bucketElementCount[i]; j++) {
                    arr[index++] = bucket[i][j];
                }
                //            为下一轮桶排序做准备
                bucketElementCount[i] = 0;
            }
        }

    }

}

8.heap sort

package com.gxmedu.sort;

import java.util.Arrays;

/**
 * @author 郭学明
 * @version 1.0
 */
public class HeapSort_ {
    public static void main(String[] args) {
//        int[] arr = {1,-4,-3,-11,92,37,16,28,12,7,6,4,5,-1,-18};
        int[] arr = {1, 92, 37, 16, 28, 12, 7, 6, 4, 5, -1, -18};
        arr = new int[8];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int) (Math.random() * 100000);
        }
        System.out.println(Arrays.toString(arr));
        heapSort(arr);
        System.out.println(Arrays.toString(arr));
    }

    public static void heapSort(int[] arr) {
//        1.形成大顶堆
        int length = arr.length;
        for (int i = length / 2 - 1; i >= 0; i--) {
            heapUp(arr, i, length);
        }
//        2.堆顶的元素和最后一个交换
//        3.再形成大顶堆，注意现在只有根节点需要调整
        for (int i = length - 1; i > 0; i--) {
            arr[i] = arr[0] + arr[i];
            arr[0] = arr[i] - arr[0];
            arr[i] = arr[i] - arr[0];
            heapUp(arr, 0, i);
        }

    }

    /**
     * 从最后一个非叶子结点开始调整,这是在传参的时候决定。
     * 对索引为i的非叶子结点进行调整
     *
     * @param arr
     */
    public static void heapUp(int[] arr, int i, int length) {
        int temp = arr[i];
        for (int j = 2 * i + 1; j < length; j = 2 * j + 1) {
            /**
             *  找到两个非叶子节点中权最大的那个
             */
            if (j + 1 < length && arr[j] < arr[j + 1]) {
                j++;
            }
            if (arr[j] > temp) {
//            if(arr[j] > arr[i]){
                arr[i] = arr[j];
                i = j;
//              有两个作用:1.让赋值的过程顺序进行下去。2.保存住需要改成temp的index
//                arr[i] = temp;
            } else {
//                如果没有进行if中的交换，下面的结点都是大顶堆，所以可以不用比较直接退出。
//                正是因为靠上的结点进行了if中的交换，破坏了若干大顶堆的结构，所以需要循环到不必交换为止。
                break;
            }
        }
        arr[i] = temp;
    }

}