note
ikegami
<c>
use List::Util qw( reduce );
sub min_idx {
my ($ar) = @_;
return reduce { $ar->[$b] > $ar->[$a] ? $b : $a } 0..$#$ar;
}
</c>
which is equivalent to the cheaper
<c>
sub min_idx {
my ($ar) = @_;
return undef if !@$ar;
my $idx = 0;
for (1..$#$ar) { $idx = $_ if $arr->[$_] > $arr->[$idx]; }
return $idx;
}
</c>
<p>Usage:
<c>
my $min_idx = min_index(\@a);
</c>
1070950
1070950