常见排序算法Java版（待续）

njauxmwj

已于 2024-02-20 22:17:36 修改

阅读量859

点赞数

文章标签：排序算法 java 算法

于 2023-10-09 23:42:25 首次发布

本文链接：https://blog.csdn.net/qq_58616732/article/details/133720862

版权

冒泡排序O(n^2)

public class Main {
    public static void main(String[] args) {
        Random random = new Random();
        int[] nums = new int[]{random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100)};
        for (int i = nums.length - 1; i >= 0; i--) {
            for (int j = 0; j < i; j++) {
                if (nums[j] > nums[j + 1]) {
                    int temp = nums[j];
                    nums[j] = nums[j + 1];
                    nums[j + 1] = temp;
                }
            }
        }
        for (int num : nums) {
            System.out.print(num + " ");
        }
    }
}

冒泡排序动图演示

选择排序O(n^2),

public class Main {

    static Random random = new Random();
    static int[] nums = new int[]{random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100)};


    public static void main(String[] args) {
        //选择排序：核心就是记录每一轮遍历的最小值的索引，进行交换
        for (int i = 0; i < nums.length; i++) {
            int idx = i;
            for (int j = i + 1; j < nums.length; j++) {
                if (nums[j] < nums[idx]) {
                    idx = j;
                }
            }
            swap(nums, i, idx);
        }
        for (int num : nums) {
            System.out.print(num + " ");
        }
    }

    private static void swap(int[] nums, int i, int j) {
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }
}

排序算法——选择排序_选择排序语句-CSDN博客

插入排序O(n^2)

   public class Main {

    static Random random = new Random();
    static int[] nums = new int[]{random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100)};


    public static void main(String[] args) {
        for (int i = 0; i < nums.length; i++) {
            int idx = i;
            for (int j = i - 1; j >= 0; j--) {
                if (nums[j] > nums[i]) {
                    nums[idx] = nums[j];
                    idx = j;
                } else {
                    break;
                }
            }
            nums[idx] = nums[i];
        }
        for (int num : nums) {
            System.out.print(num + " ");
        }
    }
}

快速排序O(nlogn)

	public class Main {

    static Random random = new Random();
    static int[] nums = new int[]{random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100), random.nextInt(100)};


    public static void main(String[] args) {
        quickSort(nums, 0, nums.length - 1);
        for (int num : nums) {
            System.out.print(num + " ");
        }
    }

    public static void quickSort(int[] nums, int left, int right) {
        if (left >= right) {
            return;
        }
        //选择一个元素做基准值
        int base = nums[left];
        int i = left;
        int j = right;
        while (i < j) {
            //注意while的顺序不能颠倒，要确保找到比基准值小的数
            while (i < j && nums[j] >= base) {
                j--;
            }
            while (i < j && nums[i] <= base) {
                i++;
            }
            swap(nums, i, j);
        }
        swap(nums, left, i);
        quickSort(nums, left, i - 1);
        quickSort(nums, i + 1, right);
    }

    private static void swap(int[] nums, int i, int j) {
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }
}