We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e17e55e commit b8504aaCopy full SHA for b8504aa
README.md
@@ -1,10 +1,11 @@
1
-[js-sort](http://aureooms.github.io/js-sort)
+[@aureooms/js-sort](https://aureooms.github.io/js-sort)
2
==
3
4
<img src="http://www.explainxkcd.com//wiki/images/b/bc/ineffective_sorts.png" width="864">
5
6
-Sorting algorithms for JavaScript. Parent is
7
-[aureooms/js-algo](https://github.com/aureooms/js-algo).
+Sorting algorithms for JavaScript.
+See [docs](https://aureooms.github.io/js-sort).
8
+Parent is [@aureooms/js-algorithms](https://github.com/aureooms/js-algorithms).
9
10
```js
11
let fordjohnson = sort._fordjohnson( search.binarysearch ) ;
0 commit comments