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.

CE have released their own take on tracing, with following notable changes compared to original ZIO Tracing:

• Instead of parsing lambdas, CE throws exceptions in IO constructors and cleans up stacktraces. That also means there is no regional control of tracing and AFAIK no way to avoid slight overhead even when tracing is completely disabled – but OTOH it may probably work on Scala.js
• Trace

Add a PR with any competitive coding problem
In

• /Practice Problems/ add competitive coding problems and solutions in the respective topic folder

Check other folders in Arrays how it is done in rest of file

E.g

• Add a folder in Arrays folder with the *N