supertwoone的博客

package com.qianfeng.day06;//快速排序public class LeetCodeTest03 { public static void main(String[] args) { int[] arr = new int[] {100,100,64,25,9,0,9,36,64,64}; int[] arrs = qsort(arr, 0, 9); for (int i = 0; i < arrs.length; i++) { System.out.

插入排序package com.qianfeng.day06;public class Test { public static void main(String[] args) { int[] arr = new int[] {1,5,3,7,2,9}; int temp; //替换数组种数的时候需要 int index; //储存序列 int choice; //选中的那个元素 for (int i = 1; i < arr.length; i++) {

冒泡排序package com.qianfeng.day06;public class Test { public static void main(String[] args) { int[] arr = new int[] {1,5,3,7,2,9}; int temp; //替换数组种数的时候需要 for (int i = 0; i < arr.length-1; i++) { for (int j = 0; j < arr.length-i-1; j+

选择排序package com.qianfeng.day06;public class Test { public static void main(String[] args) { int[] arr = new int[] {1,5,3,7,2,9}; int temp; //替换数组种数的时候需要 int index; //储存循环变量的值 int min; //储存一次循环的最小值 for (int i = 0; i < arr.length-1; i++)