Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Insert Into a Sorted Array

by gryphon (Abbot)
on Sep 29, 2004 at 03:21 UTC ( #394844=note: print w/replies, xml ) Need Help??


in reply to 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);

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;

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.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://394844]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (5)
As of 2020-11-26 01:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?