Come for the quick hacks, stay for the epiphanies. | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
I think you're right that it would be more work initially
for the "all possibilites" hash. I'm no
mathematician/statistican but I think there are more like
5! = 120 possibilities (and I certainly wouldn't want to
build that hash by hand). Tilly, you're a mathematician.
What are the correct number of possibilities?
Building the hash programmatically would be an interesting brain teaser. Update: This was assuming string lengths of up to 5. If the code and the comments disagree, then both are probably wrong. -- Norm Schryer In reply to Re: Re: Sorting characters within a string
by jlongino
|
|