Some algorithms and data-structures in JavaScript, for education purposes.
Go to file
2015-11-20 20:12:48 +03:30
.tmp initial commit 2015-07-24 11:14:18 +04:30
data-structures initial commit 2015-07-24 11:14:18 +04:30
maze initial commit 2015-07-24 11:14:18 +04:30
node_modules initial commit 2015-07-24 11:14:18 +04:30
other Pascal's triangle 2015-11-20 20:12:48 +03:30
patterns initial commit 2015-07-24 11:14:18 +04:30
search initial commit 2015-07-24 11:14:18 +04:30
sort initial commit 2015-07-24 11:14:18 +04:30
.jshintrc initial commit 2015-07-24 11:14:18 +04:30
index.js initial commit 2015-07-24 11:14:18 +04:30
package.json initial commit 2015-07-24 11:14:18 +04:30
README.md initial commit 2015-07-24 11:14:18 +04:30
utils.js initial commit 2015-07-24 11:14:18 +04:30

The algorithms are written in ES6, use babel-node to run them.

Most algorithms have a -debug version which includes logs and stuff to understand the algorithm runtime better.

I wanted to add tests for all algorithms but I haven't yet.

Feel free to fill an issue or create a pull request! 😜