Okay, so I've finished the crack problem, and it runs, but since the pset2 now tells us the passwords can be upto 5 characters long, it takes about 48 minutes to get the password match for "zzzzz".
I have to use a lot of nested for loops, and since it has to check for all the character lengths, it's slowing down the program. And, recursion will end up being slow too so I can't do that either.
Is there a more efficient way to solve this that would take considerably less time?
I also can't figure out if there are ways to not use nested for loops. Please help!