| Paketname | libtree-redblack-perl |
| Beschreibung | Perl implementation of Red/Black tree, a balanced tree |
| Archiv/Repository | Offizielles Ubuntu Archiv lucid (universe) |
| Version | 0.5-1 |
| Sektion | universe/perl |
| Priorität | optional |
| Installierte Größe | 88 Byte |
| Hängt ab von | perl (>= 5.6.0-16) |
| Empfohlene Pakete | |
| Paketbetreuer | Ubuntu MOTU Developers |
| Quelle | |
| Paketgröße | 14664 Byte |
| Prüfsumme MD5 | 20d674d4b7bf8fbcb790d44a126462ae |
| Prüfsumme SHA1 | 495c69776be07c383c3004cda1cd6c8d092e7215 |
| Prüfsumme SHA256 | f779193da0e90f71c8e2fce3408c2fd42668ec6c1e728b261738fa1e1dd587ee |
| 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.
|