Selection Sort, for example, makes the algorithm look extremely (impossibly) good at first glance - O(n) - because it's not showing the majority of the steps.

Instead of

    for (var j = i + 1; j < D.length; j++) {
        if (D[j] < D[minJ]) {
            tracer._select(j);
            minJ = j;
            tracer._deselect(j);
        }
    }

it has to be more like

    for (var j

https://mybinder.org/ Should I make a binder ? :) Or if there is a binder link, it's well hidden.

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?

A pleasure that LinkedHashMap has been added.

While I have a different point about the iterative sequence. The sequence should order by the key last time put in instead of the first time put in.

This situation is caused by the func named LinkedHashMap.Put:

// Put inserts key-value pair into the map.
// Key should adhere to the comparator's type assertion, otherwise method panics.
fu

I was trying to look up if new() allocates on the heap, or if like std it only allocates when the first item is inserted. Then I wanted to know if clone() allocates, I assume no, but a O(1) allocation on clone would also be persistent. I found the Complexity section of each doc, but did not see an ancer.

• improve listing of modules (landing page) with their title (fix odoc?)
• document on the common conventions (seq/equal/pp/…)
• basic document of types of iterators (ocamlverse?)

In ipfs/js-ipfs#2498 ipfs-log was added to the list of early tester projects - I'd like to get it running against js-IPFS release candidates in CI to get early feedback on any problems.

We use the aegir test-external command to do this - it clones a repo, does an install, runs the tests - if they pass it swaps any ipfs or ipfs-http-client deps for the release c