Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: optimizing a linear search by Indexed or bucketed hashing

by GrandFather (Sage)
on Oct 04, 2007 at 23:30 UTC ( #642788=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    use strict;
    use warnings;
    ...
    for A. This means that instead of looking through all of B, you simply
    + need to
    retrieve all records from B which start with the same first letter as 
    +the
    current record in A.
    
  2. or download this
    b: 458 499
    c: 822 900, 1053 1074
    ...
    r: 979 1053
    s: 573 651
    t: 499 573
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://642788]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (4)
As of 2020-07-10 00:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?