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

As Queue::hasPushed(QueueableActionJob::class) wont work, it might be nice to include some assertions out of the box?

    public function actionJobWasPushed(string $actionJobClass): bool
    {
        $this->assertTrue(Queue::getFacadeRoot() instanceof QueueFake, 'Queue was not faked. Use `Queue::fake()`.');

        return collect(Queue::pushedJobs()[ActionJob::class] ?? [])
  

Check the repository

You can find the book here

Go to any unsolved chapter solve it's Programming Projects.

Keep .java file in the correct folder and update the ReadMe.md accordingly.

Add a PR 😄 and be a contribu