Update readme to list goals of this project
Used Prototype to make a little better.
Added first draft of generic binary heap.
Added initial Max and Min heaps and tests. Still failing tests, and looking at internals of heaps, something is not right. Also slightly refactored binaryHeap to not create node container to store data, and fixed some small referencing issues.
Fixed spelling issues, revised list of targets
Fixed two issues with the min/max heap algorithm. Added some more tests.
Added Constructor logic to give O(n) performance adding an array.
Added a function to validate the binary heaps, and added some tests to use the validator.
Added basic trie data structure. Only add and hasWord methods are currently supported. Tests for those as well.
Added remove functionality to trie. Added tests to cover varous add/remove scenarios.
Added sort functionality and tests.
Updating readme to show addition of sort to trie
Added two algorithms to the project, and moved some files around so the project makes a bit more sense.
Merge branch 'master' of git://github.com/duereg/js-algorithms
Added simple string compression algorithm for example 1.5
Added some comments that each algorithm so I match algorithm to example in the future.
Cleaned up comments to be easier to read on github.
Added some folders, renamed some folders.
fixed path issues with require due to folder name changes
moved some tests to better match existing structure. Also added DeDupe scenario from chapter 2.