> > It also reminds me of mjd's mention of: my($first) = sort {...} @list; > > being O(n) if Perl were really Lazy. > > But it would need a completely different algorithm. Which is not too > bad. And even > > my ($first, $second, $third) = sort {...} @list; > > is kind-of plausible. So we'd definitely want ... my @heapa is heap; @heapa = @list; my $first = shift @heapa; my $second = shift @heapa; my $third = shift @heapa; -- David Nicol 816.235.1187 [EMAIL PROTECTED] Parse, munge, repeat.
- Re: Please make "last&qu... Graham Barr
- Re: Please make "last&qu... Jarkko Hietaniemi
- Re: Please make "last&qu... Bart Lateur
- Re: Please make "last&qu... Damian Conway
- Re: Please make "last&qu... Dan Sugalski
- Re: Please make "last&qu... Larry Wall
- Re: Please make "last&qu... Larry Wall
- Re: Please make "last&qu... Damian Conway
- Re: Please make "last&qu... David L. Nicol
- Re: Please make "last" work in &... Ariel Scolnicov
- Re: Please make "last" work ... David L. Nicol
- Re: Please make "last" work in "... H . Merijn Brand
- Re: Please make "last" work in &... Michael G Schwern
- Re: Please make "last" work ... John Porter
- Re: Please make "last" work in &... Larry Wall
- Re: Please make "last" work ... Dan Sugalski
- Re: Please make "last" ... Larry Wall
- Re: Please make "last&qu... Dan Sugalski
- Re: Please make "last" work in "grep&quo... James Mastros
- Re: Please make "last" work in "grep&quo... Mark-Jason Dominus