Package: libtree-redblack-perl (0.3-7) [universe]
Links for libtree-redblack-perl
Ubuntu Resources:
Download Source Package libtree-redblack-perl:
- [libtree-redblack-perl_0.3-7.dsc]
- [libtree-redblack-perl_0.3.orig.tar.gz]
- [libtree-redblack-perl_0.3-7.diff.gz]
Maintainer:
Please consider filing a bug or asking a question via Launchpad before contacting the maintainer directly.
Original Maintainers (usually from Debian):
- Debian Perl Group (Mail Archive)
- Gunnar Wolf
- gregor herrmann
It should generally not be necessary for users to contact the original maintainer.
Similar packages:
Perl implementation of Red/Black tree, a balanced tree
This is a demonstration package, showing the performance differences between different methods of data storage and accessing. It contains a perl implementation of the Red/Black tree algorithm found in the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly known as "CLR" or "The White Book"). A Red/Black tree is a binary tree which remains "balanced"- that is, the longest length from root to a node is at most one more than the shortest such length. It is fairly efficient; no operation takes more than O(lg(n)) time.
An example perl script is contained in the documentation directory, which would show the different run times using hash table, linear or tree structure.
Other Packages Related to libtree-redblack-perl
|
|
|
-
- dep: perl (>= 5.6.0-16)
- Larry Wall's Practical Extraction and Report Language
Download libtree-redblack-perl
| Architecture | Package Size | Installed Size | Files |
|---|---|---|---|
| all | 13.3 kB | 84.0 kB | [list of files] |