Maintaining partial sums in logarithmic time
Data Structures and Algorithms
2014-01-07 v1
Abstract
We present a data structure that allows to maintain in logarithmic time all partial sums of elements of a linear array during incremental changes of element's values.
Cite
@article{arxiv.1401.0921,
title = {Maintaining partial sums in logarithmic time},
author = {Jochen Burghardt},
journal= {arXiv preprint arXiv:1401.0921},
year = {2014}
}
Comments
8 pages, 3 figues. Full version of an article in the "Nordic Journal of Computing", including Hoare-style correctness proofs of algorithms