-
冒泡排序O(n^2)
javapublic 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),
javapublic 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)}; int index; for (int i = 0; i < nums.length; i++) { index = i;//每一轮记录最小值的索引 for (int j = i + 1; j < nums.length; j++) { if (nums[j] < nums[index]) { index = j; } } if (index != i) { int temp = nums[i]; nums[i] = nums[index]; nums[index] = temp; } } for (int num : nums) { System.out.print(num + " "); } } }
-
插入排序O(n^2)
javapublic 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)}; int index; for (int i = 1; i < nums.length; i++) { int rec = nums[i]; index = i; for (int j = i - 1; j >= 0; j--) { if (nums[j] > rec) { nums[index] = nums[j]; index = j; } else { break; } } nums[index] = rec; } for (int num : nums) { System.out.print(num + " "); } } }
常见排序算法Java版(待续)
坤了2023-10-10 15:35
相关推荐
诗句藏于尽头8 分钟前
更改jar素材后打包SimonKing12 分钟前
开源新锐:SQL玩转搜索引擎?Manticore颠覆你的认知古译汉书24 分钟前
嵌入式-SPI番外之按钮驱动程序的编写-Day15快去睡觉~1 小时前
力扣48:旋转矩阵中国lanwp1 小时前
Jenkins Pipeline中参数化构建记录Java学习的三木1 小时前
Java:将视频上传到腾讯云并通过腾讯云点播播放qianmoq1 小时前
第01章:Stream是什么?5分钟让你的循环代码变优雅UserNamezhangxi2 小时前
kotlin 协程笔记咖啡里的茶i2 小时前
数字化图书管理系统设计实践(java)卡洛斯(编程版2 小时前
(1) 哈希表全思路-20天刷完Leetcode Hot 100计划