| Paketname | libtree-redblack-perl |
| Beschreibung | Perl implementation of Red/Black tree, a balanced tree |
| Archiv/Repository | Offizielles Debian Archiv squeeze (main) |
| Version | 0.5-1 |
| Sektion | perl |
| Priorität | optional |
| Installierte Größe | 88 Byte |
| Hängt ab von | perl (>= 5.6.0-16) |
| Empfohlene Pakete | |
| Paketbetreuer | Debian Perl Group |
| Quelle | |
| Paketgröße | 14688 Byte |
| Prüfsumme MD5 | a6a687e083911e6f6d8cae136facfe03 |
| Prüfsumme SHA1 | 66da44492bb150dfe11536cb8c064d47bdcfbce8 |
| Prüfsumme SHA256 | a247bc967657b3613cd07663123680b2d898c6de66d9989e9648691ba9c0a9e6 |
| Link zum Herunterladen | libtree-redblack-perl_0.5-1_all.deb |
| Ausführliche Beschreibung | 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.
|