You might be interested in Tie::Array::Sorted which keeps the array sorted while you add things to it.

However, using autovivication won't work: if the array for a certain key doesn't exist yet, you'll have to create the tied array first (unless there's a clever trick I don't know).

Hope this helps, -gjb-

If you maintain the invariant that the hash starts out sorted just scan and insert it.

sub sorted_insert (\@$) {
  my( $a, $item ) = @_;

  unless( @{$a} ) { push @{$a}, $item; return }

  my $i = 0;
  while( $i <= $#{$a} ) {
     last if $a->[$i] > $item;
     $i++;
  }

  splice( @{$a}, $i, 0, $item );

  return $a
}

@a = qw( 1 2 4 6 );

sorted_insert @a, 3;
sorted_insert @a, 7;

print join( ", ", @a ), "\n";
[download]

If you want to insert an element into an array at a certain position, then check out the splice function in your docs.

shift,unshift, push and pop add or remove elements from the beginning and end of an array, respectively.

Hi, Monks I know how to sort, but sometimes are there clever tricks around to do things in one step Thanks Murcia