MaxHeap bad algorithm.

# steps to reproduce
Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

The issue points to a performance problem in the MaxHeap implementation when adding many random integers. Start by examining the MaxHeap class, likely in the Heaps directory. Compare its insertion algorithm with the BinaryHeap from the referenced Algorithmia repository to identify inefficiencies. Write a benchmark test adding 80,000 random integers to verify the slowness and confirm the fix improves performance to under a second.

索引モデルが issue の本文から書いたものです。