zzzzata的博客

package insert;import java.util.Arrays;public class ShellSort { public static void main(String[] args) { int[] A={19,10,9,8,7,6,5,4,3,2,1,0}; System.out.println(Arrays.toString(A)); System.o

package heapsort;import java.util.Arrays;public class HS1 { public static void main(String[] args) { int[] A={87,45,78,32,17,65,53,9,63}; BuildHeap(A); System.out.println(Arrays.toString(A))

package insert;import java.util.Arrays;;public class Insert1 { public static void main(String[] args) { int i,j,high,low,mid = 0; int[] A={0,3,5,65,32,76,97,34,23,56,78,23,56,27,98,20,40,50,4,

快速排序是基于冒泡排序的，同属于交换排序。思路是选择一个基值，从前后两端小于此值的放在左边，大于这个值的防在右边。然后递归，基值左边和右边再分别进行此操作。package exchenge;import java.util.Arrays;public class Quike { public static void main(String[] args) { int[] A={7,

package merge;import java.util.Arrays;public class Merge { public static void main(String[] args) { int[] A={87,45,78,32,17,65,53,9,63}; int a =A.length-1; MergeSort(A, 0, a); System.out.p