冬青的专栏

public static void insertSort(int[] array){ if(array.length==1) return; for (int i = 1; i < array.length; i++) { if(array[i]<array[i-1]){ int tmp = array[i]; int j=i-1; while(j>=0&&

package microsoft; public class MinK { public static void main(String[] args) { int[] sort = new int[] {5, 8, 4, 10, 3}; HeapSort(sort); } public static void HeapSort(int[] arr){ buildMaxH