In my program what i will do is, i will take google's top 10 results for a query and i will take the snippet's or title's from each result and compute the similarity between this returned snippet and the original query..

The computed similarity value is what i stored in the hash as key and the url's will be straightaway stored as hash value..

for e.g
$url={will contain the 10 url's grepped from xml result file}

$value=sim();#will contain the similarity computed for all the ten res
+ults;

%hash;
sim{
#here i compute similarity between query title and resulted snippet..
return $val;#i will return similarity value for each result
}


$hash{$value}=$url;#storing key & value in hash

#i will sort the keys in hash in descending order to get the highest v
+alue in top and print the url associated with that as a ouput..
[download]

Ok, given what you are doing your choice of using a hash is fair enough. The precision of the floating point values is fairly unimportant so any rounding or truncation that happens when using the numbers as keys is very unlikely to matter. To select the top N URLs I'd do something like:

use strict;
use warnings;

my %urls = (
    0.999 => 'www.perlmonks.org',
    0.65  => 'www.snakewranglers.org',
    0.451 => 'www.jewelmerchants.org',
    0.222 => 'www.coffeemerchants.org',
    0.12  => 'www.scriptkiddies.org',
);
my @inOrder = sort {$b <=> $a} keys %urls;
my @topThree = splice @inOrder, 0, 3;

print "$_: $urls{$_}\n" for @topThree;
[download]

Prints:

0.999: www.perlmonks.org
0.65: www.snakewranglers.org
0.451: www.jewelmerchants.org
[download]

True laziness is hard work

Hi GrandFather,

Thanks for the post. But this sorting and getting the highest value, i have already done.

I have asked for how could i get the values that are higher than certain threshold.. Plz let me know if my explanation is not adequate..