Пакет: libtree-redblack-perl (0.5-2)
Ссылки для libtree-redblack-perl
Ресурсы Trisquel:
Исходный код libtree-redblack-perl:
- [libtree-redblack-perl_0.5-2.dsc]
- [libtree-redblack-perl_0.5.orig.tar.gz]
- [libtree-redblack-perl_0.5-2.debian.tar.xz]
Сопровождающий:
Original Maintainers:
- Debian Perl Group (Почтовый архив)
- gregor herrmann
- Damyan Ivanov
Внешние ресурсы:
- Сайт [metacpan.org]
Подобные пакеты:
Perl implementation of Red/Black tree, a balanced tree
Tree::RedBlack 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.
Другие пакеты, относящиеся к libtree-redblack-perl
|
|
|
-
- dep: perl
- Larry Wall's Practical Extraction and Report Language
Загрузка libtree-redblack-perl
Архитектура | Размер пакета | В установленном виде | Файлы |
---|---|---|---|
all | 13,1 Кб | 40 Кб | [список файлов] |