The binary-indexed-tree package

[Tags: lgpl, library]

Binary indexed trees are a data structure on indexes 1 through n. They allow you to compute the sum of all values at indexes 1 through i in O(logn) and to increase the value at index i in O(logn).

This implements binary indexed trees, both as an immutable data structure in pure code and as a mutable data structure using the ST Monad.

Both the immutable and mutable version have the same runtime complexity, but the mutable version has a smaller constant.

Written by Maxwell Sayles (2012).


Properties

Version0.1
Dependenciesarray (>=0.3), base (>=3 && <5)
LicenseLGPL
AuthorMaxwell Sayles <maxwellsayles@gmail.com>
MaintainerMaxwell Sayles <maxwellsayles@gmail.com>
StabilityStable
CategoryData
Upload dateWed Oct 10 21:19:48 UTC 2012
Uploaded byMaxwellSayles
Downloads119 total (16 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees