in reply to Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1

    try1a => sub {
        my $high = my @list = sort { $a <=> $b } @input;
        my $mid = my $low = 0;
        $list[$mid = $low + $high >> 1] < 0 ?
          ($low = $mid + 1) : ($high = $mid) while $low < $high;
        push @list, splice @list, 0, $low;
        Compare(\@list,\@output) or die "@list" if DO_CHECK;
    },

[download]

Grumble... I hate speed contests :(

Although that "push" line is quite interesting. perl++

Replies are listed 'Best First'.
Re^2: Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1
by shmem (Chancellor) on Feb 06, 2019 at 03:15 UTC
    Although that "push" line is quite interesting. perl++

    The "push" line isn't the punchline. The punchline is how you calculate $low for the splice, which amounts to 7 iterations of the while loop for the sample data. Then, the array reordering is done with one fell swoop. Takes some time to grok that. tybalt89++

    perl -le'print map{pack c,($-++?1:13)+ord}split//,ESEL'
[reply]
[d/l]

In Section Seekers of Perl Wisdom