heapSort with bug: the Length of heap is always changing
debug heapSort
-a
This commit is an explanation of the last commit "-a"

for last commit "-a", there is a wired bug.

	we should use (l < heap_size ) ether than (l <= heap_size)
	as the same way, use ( r < heap_size ) replace (r <= heap_size)

in algorithms, these faluts may have a big influence....
code refine
some comments