摘要： --heap sort . O(n*logn). auxiliary space O(1). Unstable sorting. class ArraySort { static void Main(string[] args) { //give up 0 index. get/set from 1 so that getting right index when do j=2*i. int[] a = new int[11] {0,5,77,1,61,11,59,15,48,47,25 }; ... 阅读全文