Michael Alipio daem0n...@yahoo.com wrote:
Can anyone tell me how the code above works? My original program must
deal with arbitrary length and generate all the possible combinations
(even repeating) of a particular set. What could take me gazillions of
for loops for that, somebody just came up
confused me more is that the return
value of substr was assigned the $_.
If someone can help me decipher each line, i'll be very happy.
--- On Mon, 10/26/09, Thomas Bätzler t.baetz...@bringe.com wrote:
From: Thomas Bätzler t.baetz...@bringe.com
Subject: AW: compact my wordlist generator
On 10/26/09 Mon Oct 26, 2009 8:45 AM, Michael Alipio
daem0n...@yahoo.com scribbled:
Thanks for the advice. Forgive me if I sounded like someone who's frustrated,
couldn't do his homework asking somebody else for help.
When I was learning C programming, I read that learning those difficult
Michael Alipio daem0n...@yahoo.com wrote:
I knew I needed a recursive function, I just didn't know how to start.
That is usually the easy part - you start out by solving the problem for a base
case, and then you embellish.
With regard to your problem of generating all combinations of a set of
A bit of CS philosophy if you may...
On Monday 26 Oct 2009 18:41:23 Jim Gibson wrote:
On 10/26/09 Mon Oct 26, 2009 8:45 AM, Michael Alipio
daem0n...@yahoo.com scribbled:
Thanks for the advice. Forgive me if I sounded like someone who's
frustrated, couldn't do his homework asking
