Java四种排序(冒泡,选择,插入,希尔) 发表于 2019-12-25 | 分类于 ---Java | 参考https://www.runoob.com/w3cnote/ten-sorting-algorithm.html 冒泡排序 123456789101112131415161718static void t2(){ int[] nums = {5, 2, 4, 1, 3}; for (int i = 0; i < nums.length - 1; i++) { for (int j = 0; j < nums.length - i - 1; j++) { if (nums[j] > nums[j + 1]) { int temp = nums[j]; nums[j] = nums[j + 1]; nums[j + 1] = temp; } } } System.out.println(Arrays.toString(nums));} 选择排序 1234567891011121314151617181920212223static void t3(){ int[] nums = {5, 2, 4, 1, 3}; for (int i = 0; i < nums.length - 1; i++) { int flag = i; for (int j = i + 1; j < nums.length; j++) { if (nums[j] < nums[flag]) { flag = j; } } if (flag != i) { int temp = nums[i]; nums[i] = nums[flag]; nums[flag] = temp; } } System.out.println(Arrays.toString(nums));} 插入排序 12345678910111213141516171819202122static void t4(){ int[] nums = {5, 2, 4, 1, 3}; for (int i = 1; i < nums.length; i++) { int temp = nums[i]; int flag = i; while (flag > 0 && temp < nums[flag - 1]) { nums[flag] = nums[flag - 1]; flag--; } if (flag != i) { nums[flag] = temp; } } System.out.println(Arrays.toString(nums));} 希尔排序自己百度,我感觉挺麻烦的,网上说是插入排序的升级版.