Re^3: Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1


Your skill will accomplish what the force of many cannot
	PerlMonks

Re^3: Fastest way to sort a list of integers into 0,1,2,3,-3,-2,-1

by Discipulus (Canon)

on Feb 05, 2019 at 20:48 UTC ( [id://1229437]=note: print w/replies, xml )

Need Help??

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

Hello hdb

> version will be very slow if there are only negative numbers... ;)

eh eh, you are right but the check does not slow it at all..

Discipulus => sub{
        my @list = sort {$a<=>$b} @input;
        if ($list[0] < 0 and $list[-1] > 0){
            push @list, shift @list until $list[0] >= 0;
        }
        Compare(\@list,\@output) or die "@list" if DO_CHECK;
    },
[download]

update: more test cases.. more checks!

Discipulus4 => q{ # https://www.perlmonks.org/?node_id=1229437
        @list = sort {$a<=>$b} @list;
        if ($list[0] < 0 and $list[-1] >= 0)
            { push @list, shift @list until $list[0] >= 0 }        },
[download]

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.