https://github.com/trekhleb/javascript-algorithms/blob/master/src/algorithms/sets/cartesian-product/cartesianProduct.js#L8

I think it makes more sense to return an empty array

// invalid input return null or throw an error
if (!setA || !setB) {
    return null;
}
if (!setA.length || !setB.length) {
    return []; 
}
// or do nothing since the for loop will not trigger anyway

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

Hey Yangshun,
Thanks for the great list of guides!

I found the explanation for Snake game bit difficult to follow and I came across this interesting and better explanantion here https://www.youtube.com/watch?v=AaGK-fj-BAM

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

我将开始翻译如下文章（点击可查看目标文章）：

高频面试系列/koko偷香蕉.md

我准备将它翻译成：英文

**预计 7 天内

没错，我来杠自己写的文章【滑稽】

刚刚翻了一下Notepad++ - OI Wiki这个页面，发现GIF或许有碍阅读，一个GIF加载需要较长时间，对于网速慢的同学就是一场灾难

目前可以考虑在GIF之外再写一遍文字，但是GIF还是会占用加载时间；或者页面只保留文字，给一个GIF的链接；再不济只保留文字，删去GIF

欢迎投票:)

[![](https://api.gh-polls.

Add quickselect algorithm. Quickselect is a selection algorithm to find the kth smallest element in an unordered list.

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 :)

The LPNorm here is extraneous as an LpNorm is already included in the FeaturizeText by default:
https://github.com/dotnet/machinelearning-samples/blob/c3b14f76b1fd88eb75015cb1198da52ec17c967d/samples/csharp/getting-started/BinaryClassification_SpamDetection/SpamDetectionConsoleApp/Program.cs#L41-L49

If you want it to be explicit, you can call out the LpNorm within the FeaturizeText options, b