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

Re: Re (5): Puzzle: need a more general algorithm

by Ovid (Cardinal)
on Jul 09, 2002 at 15:42 UTC ( #180519=note: print w/replies, xml ) Need Help??

in reply to Re(5): Puzzle: need a more general algorithm
in thread Puzzle: need a more general algorithm

After giving this some thought, I realized that traditional permutation generators are going to have a problem here. Consider the following four permutations:

11100 11100 11100 11100

Those can be different permutations. The second could have the first and second ones swapped, the third could have the last fourth and fifth zeroes swapped, etc. Even though, to us, they look the same, the permutators that I've played with don't see that (and how would they calculate it?).

And it was an interesting coincidence to see the Knuth thread on /. this morning. I'm checking it out now.


Join the Perlmonks Setiathome Group or just click on the the link and check out our stats.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (2)
As of 2023-06-07 17:02 GMT
Find Nodes?
    Voting Booth?
    How often do you go to conferences?

    Results (29 votes). Check out past polls.