edit - this is essentially the same as Tybalt's entry in 1229444, which I missed when posting.
Here's one that is adapted from Discipulus and haukex3. Using a binary search will speed up the search for the inflection point, while pushing and splicing in one pass avoids repeated pushes. It should scale better as the data increases in size.
The binary search needs a recent version of List::MoreUtils. I've specified the latest here, but one could go somewhat older I think. One could also use List::BinarySearch::XS
swl => sub { my @list = @input; use List::MoreUtils 0.428; @list = sort {$a<=>$b} @list; my $i = List::MoreUtils::bsearchidx {$_ <=> 0} @list; push @list, splice @list, 0, $i-1; Compare(\@list,\@output) or die "@list" if DO_CHECK; }
In reply to Re: Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1
by swl
in thread Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1
by haukex
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |