Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re^2: how to sort string in perl

by Anonymous Monk
on Dec 05, 2012 at 17:44 UTC ( #1007345=note: print w/replies, xml ) Need Help??

in reply to Re: how to sort string in perl
in thread how to sort string in perl

I like stooge sort more. It can be much more efficient: I used functional-programming techniques which means it can be trivially parallelised over many CPUs.

sub stoogesort { my (@lst) = @_; if ($lst[-1] < $lst[0]) { # swap @lst[0, -1] = @lst[-1, 0]; } return @lst if (@lst < 3); # thirds my $zero = 0; my $one = int(@lst / 3); my $two = int($#lst * 2 / 3); my $three = $#lst; for my $range ( [ $zero .. $two ], [ $one .. $three ], [ $zero .. $two ] ) { @lst[ @$range ] = stoogesort( @lst[ @$range ] ); } return @lst; } my @list = (1, 2, 3, 9, 6, 4, 5, 7, 0); print join(" ", stoogesort(@list)), "\n";

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1007345]
[1nickt]: choroba Understood. I'm wondering about the logic in a cpanfile. If the perl doesn't support threads, it's easy: require MCE. If the perl does support threads, as you say the user has a choice, so require both? Or, assume that irrespective of the choide
[1nickt]: ... choice, the threaded-perl user *probably* wants to use threads, therefore only require threads and leave MCE out, allowing the user to manually install if desired?
[choroba]: just require any of MCE and threads. Not sure if that's possible in the cpanfile, but should be possible early in the Makefile
[1nickt]: The app expects threads as default anyway, right?
[choroba]: that's true
[1nickt]: expects threads *to be* the default
[1nickt]: I think cpanfile can handle the logic. testing now.

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (14)
As of 2017-10-18 13:24 GMT
Find Nodes?
    Voting Booth?
    My fridge is mostly full of:

    Results (244 votes). Check out past polls.