Binary Indexed Tree
Binary Indexed Tree(aka Fenwick Tree) implementation
Install
Install with npm:
$ npm install binary-indexed-tree
BIT?
Binary Indexed Tree (aka Fenwick Tree) is a data structure providing efficient methods for prefix-sum.
Usage
Read the DOC.
Changelog
Read the CHANGELOG.
Running tests
Install devDependencies and Run npm test:
$ npm -d it
Contributing
Pull requests and stars are always welcome. For bugs and feature requests, please create an issue.
- Fork it!
- Create your feature branch:
git checkout -b my-new-feature - Commit your changes:
git commit -am 'Add some feature' - Push to the branch:
git push origin my-new-feature - Submit a pull request :D
License
Copyright © 2016-present berlysia. Licensed under the MIT license.