Re: Numeric sorting WITHOUT <=>

[ikegami]

in reply to Numeric sorting WITHOUT <=>

my ($min) = keys(%jetsons);
my $max = $min;
for (keys(%jetsons)) {
   $max = $_ if $_ > $max;
   $min = $_ if $_ < $min;
}

my @sorted;
for ($min..$max) {
   push @sorted, $_
      if exists($jetsons{$_});
}

[Marshall]

my ($min) = keys(%jetsons); This is the number of keys in %jetsons.
This is not the min.

[AnomalousMonk]

my ($min) = keys(%jetsons); This is the number of keys in %jetsons.

Actually, it's a randomly (insofar as the hashing algorithm is random) chosen key from the hash. The assignment is in list context and seeds the min/max finder loop that follows.

>perl -wMstrict -le
"my %jetsons = qw(aa 1  bb 2  cc 3  dd 4  ee 5);
 my ($min) = keys %jetsons;
 print $min;
"
cc

Update: ikegami's code works. (Never doubt a Pope.)

[ikegami]

No.

# keys in scalar context: Number of keys.
my $min = keys(%jetsons);

# keys in list context: List of keys. First one is assigned
my ($min) = keys(%jetsons);

[Marshall]

Correct.
My mistake.

[ria1328]

Thank you! This worked and it actually made it easier for me to understand how it was done instead of using the was my professor said we should!

[ikegami]

This worked and it actually made it easier for me to understand how it was done

My code does NOT demonstrate how sorting is usually done. It takes a different and silly approach in response to your equally silly requirement. It would take forever for my solution to sort

my %jetsons = ( 0 => "a", 4000000000 => "b" );