摘要： Insertion sortis a simplesorting algorithmthat builds the finalsorted array(or list) one item at a time. It is much less efficient on large lists than... 阅读全文

摘要： Heap的介绍1，介绍2，要注意complete tree和full tree的区别, Heap是complete tree；Heap里面 i 的 children分别是 i*2+1 和 i*2+2，i 的 parent是 (i-1)/2 Heapify的基本思路就是：Given an array 阅读全文