Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: How can I improve the efficiency of this very intensive code?

by hv (Parson)
on Aug 06, 2005 at 23:36 UTC ( #481573=note: print w/replies, xml ) Need Help??


in reply to How can I improve the efficiency of this very intensive code?

It may be that sorted arrays are the way to go, as mentioned elsewhere. But it might make sense to go from the data you have now to an inverted list of best matches, so as to sort each list only once:

my $inv = {}; for my $index (keys %$rc) { my $subhash = $rc->{$index}; my @sorted = sort { $subhash->{$a} <=> $subhash->{$b} } keys %$sub +hash; if ($subhash->{$sorted[0]} < $subhash->{$sorted[1]}) { # this is the best match push @{ $inv->{$sorted[0]} }, $index; } }
and now the strong match test becomes:
return (@{ $inv{$id2} } == 1) ? 1 : 0;

I'm not sure that I fully understand the problem, so the code might need some tweaking ...

Hugo

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (6)
As of 2020-06-02 02:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you really want to know if there is extraterrestrial life?



    Results (12 votes). Check out past polls.

    Notices?