1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
Source: libtree-redblack-perl
Section: interpreters
Priority: optional
Build-Depends: debhelper (>= 3.0.5), perl (>= 5.6.0-20)
Maintainer: Stephen Zander <gibreel@debian.org>
Standards-Version: 3.5.4
Package: libtree-redblack-perl
Architecture: all
Depends: ${perl:Depends}
Description: 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.
|
