Using the fact that a negative value read as an unsigned is bigger than any signed positive: eily => sub {
my @list = -50..50;
@list = sort { ~$b <=> ~$a } @list;
Compare(\@list,[0..50,-50..-1]) or die "@list" if DO_CHECK;
}
Rate grepfirst sortfirst eily
grepfirst 59577/s -- -14% -32%
sortfirst 69292/s 16% -- -21%
eily 87583/s 47% 26% --
In reply to Re: Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1
by Eily
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.
|