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.

• User case:
  • for programmers new to the library to get some context on how to add customization functions and styles
• Implementation ideas:
  • Thinking of creating a markdown doc or webpage or something

Perhaps it should be opt-in, but most usage would expect a BOM is ignored.