Re: Insert Into a Sorted Array

Greetings ketema,

I don't know how wise this is (it feels unwise to me), but here's my code:

my @known = (
  { Attribute => 5 },
  { Attribute => 4 },
  { Attribute => 8 },
  { Attribute => 3 },
  { Attribute => 7 },
  { Attribute => 2 }
);

sub byIndex { $a->{Attribute} <=> $b->{Attribute} }
@known = sort byIndex @known;
my $new_item = { Attribute => 6 };
for (my $x = 0; $x < @known; $x++) {
  if ($new_item->{Attribute} <= $known[$x]->{Attribute}) {
    splice(@known, $x, 1, $new_item, $known[$x]);
    last;
  }
}
print $_->{Attribute}, "\n" foreach (@known);
[download]

Is there any way you can add items into @known all before your sort, then sort only once at the end? Seems to me that'd be better.

gryphon
code('Perl') || die;

Comment on Re: Insert Into a Sorted Array Download Code

Replies are listed 'Best First'.
Re^2: Insert Into a Sorted Array by ketema (Scribe) on Sep 29, 2004 at 03:37 UTC
You and I must think alike because this is almost exactly what I did by myself, but it is too slow, and no I can't sort at the end for this application, we wind up sorting too much. :> I'm going to use teh binary search provided above, thanks for the input though.	[reply]

In Section Seekers of Perl Wisdom