排序算法
zcjluse
这个作者很懒,什么都没留下…
展开
-
排序算法-选择排序
package selection; import java.util.Arrays; public class Test1 { public static void main(String[] args) { int[] numbers= {2,1,3,4,5,6,7,8,4,3,2,2,0,-1,-2,100,20,34332}; for (int i = 0; i < numbers.length; i++) { int tem原创 2021-01-26 16:50:34 · 61 阅读 · 0 评论 -
排序算法-插入排序
package insertion; import java.util.Arrays; public class Test1 { public static void main(String[] args) { int[] numbers= {2,1,3,4,5,6,7,8,4,3,2,2,0,-1,-2,100,20,34332}; for (int i = 1; i < numbers.length; i++) { int tem原创 2021-01-26 16:20:14 · 55 阅读 · 0 评论 -
排序算法-冒泡排序
package bubble; import java.util.Arrays; //冒泡排序,稳定的排序算法,把最大或者最小的数逐渐向右或向左移动 public class Test1 { public static void main(String[] args) { int[] numbers= {1,2,3,4,5,6,7,8,4,3,2,2}; for (int i = 0; i <numbers.length ; i++) {原创 2021-01-26 15:20:07 · 62 阅读 · 0 评论 -
排序算法-基数排序(基于桶排序)
package radix; import java.util.Arrays; public class Test1 { public static void main(String[] args) { String[] numbers={"18144154252","18144154262","18144154253"}; int[] bucket=null; String[] R=null; for (int j = 10; j原创 2021-01-26 15:00:42 · 106 阅读 · 0 评论 -
排序算法-桶排序(计数排序)
package bucket; //桶排序---计数排序 import java.util.Arrays; //题目:给分数 0-5分的同志排序 假设 0,2,3,0,2,0,5,4,1 public class Test1 { public static void main(String[] args) { int[] numbers={2,5,3,0,2,3,0,3}; //数组下标代表分数 也就是0-5分 int[] bucket=new .原创 2021-01-26 10:08:33 · 108 阅读 · 0 评论 -
排序算法-快速排序
package partition; import java.util.Arrays; public class Test1 { public static void main(String[] args) { int[] numbers={1,2,3,4,5,6,0,7,8,9,10,0}; partitionSort(numbers,0,numbers.length-1); // for (int n:numbers) { //原创 2021-01-25 21:48:34 · 84 阅读 · 0 评论 -
排序算法-归并算法
package merger; import com.sun.tools.javac.util.ArrayUtils; /** * 归并算法 */ public class Test1 { public static void main(String[] args) { int[] numbers={1,4,9,33,2,55,24,6,99}; mergerSort(numbers); for (Integer i: numbers ) {原创 2021-01-25 17:30:09 · 103 阅读 · 1 评论