>
>And it doesn't work. Any help is appreciated.
>
Hello,I'd modify your script as follow,and it could work for me.
use strict;
use warnings;
my %rules_new = (aaa => [11,22,33,44],
bbb => [55,66,77,88],
);
for my $rule (sort {&compute_probability($b) <=> &compu
the key.
Wags ;)
-Original Message-
From: Rajendra Babu, Praveen
[mailto:[EMAIL PROTECTED]]
Sent: Monday, December 30, 2002 16:29
To: 'Mark Anderson'; [EMAIL PROTECTED]
Subject: RE: Sorting hash "values"
Hello /\/\ark,
Thanks for your reply. The below code
h $key ( sort { $hash{$b} <=> $hash{$a} } keys %hash )"
Can someone please explain ???
-Praveen
-Original Message-
From: Mark Anderson [mailto:[EMAIL PROTECTED]]
Sent: Tuesday, 31 December 2002 10:23 AM
To: Rajendra Babu, Praveen; [EMAIL PROTECTED]
Subject: RE: Sorting hash &
$ perl -e '
%hash = (
"h" => 100,
"a" => 2000,
"z" => 50,
"b" => 600
);
for(sort { $hash{$b} <=> $hash{$a} } keys %hash) {
print $hash{$_}, " = $_\n";
}'
2000 = a
600 = b
100 = h
50 = z
HTH
"Rajendra Babu" <[EMAIL PROTECTED]> wrote in message
[EMAIL PROT
It helps to answer your question if you show us what you've already done,
and tell us what you know...
perldoc -f keys
perldoc -f sort
/\/\ark
-Original Message-
From: Rajendra Babu, Praveen
[mailto:[EMAIL PROTECTED]]
Sent: Monday, December 30, 2002 3:16 P
