Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: Algorithm help

by Anonymous Monk
on Jan 09, 2001 at 22:34 UTC ( #50728=note: print w/replies, xml ) Need Help??

in reply to Algorithm help
in thread Search Algorithm

@fruit=qw(apples oranges pears); for $f0 (@fruit){ for $f1( "",@fruit ){ print "$f0$f1\n" unless $f0 eq $f1; }}

Replies are listed 'Best First'.
Re: Re: Algorithm help
by eg (Friar) on Jan 09, 2001 at 23:26 UTC

    Here's the same thing, except using nested maps. Is there a way to do this in just one pass?

    my @fruit = qw/ apples oranges pears /; my @salad = mix_up( @fruit ); print join(', ', @salad), "\n"; sub mix_up { return map { my $tmp=$_; map { $tmp eq $_ ? $_ : "$tmp$_" } @_; } +@_; }

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://50728]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (10)
As of 2016-10-28 17:18 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (386 votes). Check out past polls.