Hello
haukex,
I have not seen others but here are two attempts. Anyway i bet on tybalt89's regex ;)
Discipulus => sub{
my @list = @input;
my @neg = sort {$a<=>$b} grep { $_ < 0 } @list;
my @pos = sort {$a<=>$b} grep { $_ >= 0} @list;
@list = (@pos,@neg);
Compare(\@list,\@output) or die "@list" if DO_CHECK;
},
Discipulus2 => sub{
my @list = sort {$a<=>$b} @input;
push @list, shift @list until $list[0] >= 0;
Compare(\@list,\@output) or die "@list" if DO_CHECK;
},
UPDATE what I first imagined was a sort block.. now after the right dose of spaghetti..
Discipulus3 => sub{
my @list = sort {
(( $a >= 0 and $b >= 0)
or
($a < 0 and $b < 0 )) ?
$a<=>$b :
$b<=>$a
} @input;
Compare(\@list,\@output) or die "@list" if DO_CHECK;
},
#OUTPUT
Rate Discipulus Discipulus3 Discipulus2
Discipulus 46252/s -- -14% -46%
Discipulus3 53805/s 16% -- -38%
Discipulus2 86380/s 87% 61% --
L*
There are no rules, there are no thumbs..
Reinvent the wheel, then learn The Wheel; may be one day you reinvent one of THE WHEELS.
In reply to Re: Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1
by Discipulus
in thread Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1
by haukex
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.