все параметры
buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ Источник: libtree-redblack-perl  ]

Пакет: libtree-redblack-perl (0.5-2)

Ссылки для libtree-redblack-perl

Screenshot

Ресурсы Debian:

Исходный код libtree-redblack-perl:

Сопровождающие:

Внешние ресурсы:

Подобные пакеты:

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.

Теги: Разработка программного обеспечения: Разработка на Perl, Библиотеки, Реализовано на: Perl, Роль: Библиотека разработчика

Другие пакеты, относящиеся к libtree-redblack-perl

  • зависимости
  • рекомендации
  • предложения
  • enhances

Загрузка libtree-redblack-perl

Загрузить для всех доступных архитектур
Архитектура Размер пакета В установленном виде Файлы
all 13,5 Кб41,0 Кб [список файлов]