-
冒泡排序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
相关推荐
有谁看见我的剑了?几秒前
Linux 内存巨页与透明巨页学习勿忘,瞬间2 分钟前
Spring Boot苯酸氨酰糖化物2 分钟前
基于深度学习(U-Net架构下改良GAN与ViT算法)的高效肺部多模态疾病预测模型feng_you_ying_li5 分钟前
异常,try catch ,throw的介绍与运用SimonKing8 分钟前
AI大模型中转平台,无需科学上网就可以使用国外模型其实防守也摸鱼9 分钟前
ctfshow--VIP题目限免(包含原理和知识拓展)前10个自我意识的多元宇宙10 分钟前
二叉树遍历方式代码解读(1递归)逻辑驱动的ken19 分钟前
Java高频面试考点04_日拱一卒20 分钟前
LeetCode:142环形链表Ⅱ回忆2012初秋21 分钟前
C# 射线算法:判断GPS点是否在车辆工作区域内