[algorithm-bit-xs.git] / README

Algorithm-BIT-XS version 0.003
==============================

A binary indexed tree is a data structure similar to an array of integers.
The two main operations are updating an element and calculating a
prefix sum, both of which run in time logarithmic in the size of the tree.

INSTALLATION

To install this module type the following:

   perl Makefile.PL
   make
   make test
   make install

DEPENDENCIES

No modules outside Perl core are needed.

COPYRIGHT AND LICENCE

Copyright (C) 2017 by Marius Gavrilescu

This library is free software; you can redistribute it and/or modify
it under the same terms as Perl itself, either Perl version 5.24.1 or,
at your option, any later version of Perl 5 you may have available.
Commit	Line	Data
43fc37ce	1	Algorithm-BIT-XS version 0.003
0e4f7002 MG	2	==============================
	3
	4	A binary indexed tree is a data structure similar to an array of integers.
	5	The two main operations are updating an element and calculating a
	6	prefix sum, both of which run in time logarithmic in the size of the tree.
	7
	8	INSTALLATION
	9
	10	To install this module type the following:
	11
	12	perl Makefile.PL
	13	make
	14	make test
	15	make install
	16
	17	DEPENDENCIES
	18
	19	No modules outside Perl core are needed.
	20
	21	COPYRIGHT AND LICENCE
	22
	23	Copyright (C) 2017 by Marius Gavrilescu
	24
	25	This library is free software; you can redistribute it and/or modify
	26	it under the same terms as Perl itself, either Perl version 5.24.1 or,
	27	at your option, any later version of Perl 5 you may have available.
	28
	29