So first sort by signum, but zero go first, then sort normally:
#!/usr/bin/perl
use warnings;
use strict;
use Test::More;
use Test::Deep;
my @in = -2 .. 2;
my @exp = (0, 1, 2, -2, -1);
my @sorted = sort {
((-1, 0, 1)[$a <=> 0] <=> (-1, 0, 1)[$b <=> 0]) || ($a <=> $b)
} @in;
cmp_deeply([@sorted], [@exp]);
done_testing();
Update: It seems comparable to grepfirst, thus slower than sortfirst.
Update 2: This seems to be a bit faster than grepfirst, but still not as fast as sortfirst:
((($a <=> 0) & 3) <=> (($b <=> 0) & 3)) || ($a <=> $b)
map{substr$_->[0],$_->[1]||0,1}[\*||{},3],[[]],[ref qr-1,-,-1],[{}],[sub{}^*ARGV,3]
In reply to Re: Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1
by choroba
in thread Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1
by haukex
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.