I have solved it. I have missed one line of code
it('should search number in sorted array', () => {

Originally posted by @GharbiSlim in trekhleb/javascript-algorithms#346 (comment)

• We have BFS and DFS images in both Breadth First Traversal and Depth First Traversal. We should have illustrations in the respective sections.

There should be a README file for each type of design pattern which should include the following points-

• Description of the design pattern
• Common use cases of that design pattern
• Explanation of the code

I just noticed that links in README are relative. They don't work in PyPI site repo page. (And the cool algorithms logo don't show up). Should we make them absolute links, or is there a better way?
Also, how do we update this current version to PyPI?
@danghai @keon What's our progress with Sphinx?

There are 2 places we are using BufferBlock<T> today:

https://github.com/dotnet/machinelearning/blob/b7db4fa475ba4bd52824eb98bbf5f5bf4a0a6f7a/src/Microsoft.ML.Data/Transforms/RowShufflingTransformer.cs#L486-L487

https://github.com/dotnet/machinelearning/blob/b7db4fa475ba4bd52824eb98bbf5f5bf4a0a6f7a/src/Microsoft.ML.Sweeper/AsyncSweeper.cs#L171

We should consider replacing this depende

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.

For a university school project I will be making some edits to your documentation which will aim to make writing more technical

Please add edits if you would like :)

.NET Core 2.2 reaches end of life December 23. Either upgrade the version to 3.1 LTS, which is what users should be already doing anyway, or target multiple versions of .NET Core so users who are still on 2.x are not broken.