摘要: public static void heapsort(int[] a) { int len = a.length; //构建堆 for(int i = len / 2 - 1;i >= 0 ;i-- ) { heapadjust(a,i,len - 1); } for(int j=len -1;j 阅读全文
posted @ 2020-04-16 09:00 若离若不弃 阅读(181) 评论(0) 推荐(0)