Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re^2: How can one get all possible combinations of a string without changing positions & using window size?

by supriyoch_2008 (Scribe)
on Apr 21, 2013 at 01:22 UTC ( #1029694=note: print w/ replies, xml ) Need Help??


in reply to Re: How can one get all possible combinations of a string without changing positions & using window size?
in thread How can one get all possible combinations of a string without changing positions & using window size?

Hi hdb

Thanks for your quick reply and the code. I am not sure whether it can be reformulated as 2^10 combinations of 1's and 2's. But your code has partly solved my problem because it has produced some combinations without changing positions of letters in the string. I shall try to understand your code. If I find any difficulty, I shall get back to you.

With regards,


Comment on Re^2: How can one get all possible combinations of a string without changing positions & using window size?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (22)
As of 2015-07-28 13:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (255 votes), past polls