| Name : perl-Tree-RedBlack
| |
| Version : 0.5
| Vendor : (none)
|
| Release : 1
| Date : 2009-10-16 10:46:38
|
| Group : Development/Languages/perl
| Source RPM : perl-Tree-RedBlack-0.5-1.src.rpm
|
| Size : 0.02 MB
| |
| Packager : (none)
| |
| Summary : Tree::RedBlack - Perl implementation of Red/Black tree, a type of balanced tree
|
Description :
This is 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.
|
RPM found in directory: /vol/rzm5/linux-pld-linux/dists/3.0/2016/PLD/noarch/RPMS |
