Quoth [EMAIL PROTECTED] (Larry Wall):
> Okay, combining all these approaches minimalistically but without
> golfing we get something like:
>
> my @numbers = sort { rand }, constant @goal = 1..9;
> my $steps = 0;
>
> until @numbers ~~ @goal {
>say [EMAIL PROTECTED];
>@
Okay, combining all these approaches minimalistically but without
golfing we get something like:
my @numbers = sort { rand }, constant @goal = 1..9;
my $steps = 0;
until @numbers ~~ @goal {
say [EMAIL PROTECTED];
@numbers[ 0 ..^ prompt "Reverse how many? " ] .= reverse;
su, 2006-09-17 kello 20:36 +0200, Juerd kirjoitti:
> while ("@numbers[]" ne "@numbers.sort()") {
Should C be used here?
while @numbers !eqv @numbers.sort {
--
Ilmari Vacklin <[EMAIL PROTECTED]>
signature.asc
Description: Digitaalisesti allekirjoitettu viestin osa
* William Herrera <[EMAIL PROTECTED]> [2006-09-17 21:50]:
> perl 5 (9 lines, 353 bytes)
>
> use FreezeThaw qw(cmpStr);
>
> my @a1_9 = (1 .. 9);
> my @numbers = sort {rand(10) > $a} @a1_9;
>
> for (my $steps = 0; cmpStr([EMAIL PROTECTED], [EMAIL PROTECTED]); ++$steps) {
>print join(" ", @num
William Herrera skribis 2006-09-17 13:45 (-0600):
> Ruby (10 lines, 274 bytes)
This is the nicest example, so I'll base my response off this one.
my @numbers = (1..9).sort:{ rand };
my $steps = 0;
while ("@numbers[]" ne "@numbers.sort()") {
say "@numbers";
my $flipcoun
