The other points of you post are quite valid - but I did not write anything against them. I would just add to it that can use a tied hash to accomplish the goal of maintaining data in a binary tree, by using for example BerkeleyDB::Btree.
In reply to Re: Re: Binary searching with Perl.
by zby
in thread Binary searching with Perl.
by DigitalKitty
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |