I think that this would be very silly to do. bad kung foo. The recoursion technique would be more satisfying. You sholud consider that this would take about 4 lines to write. Also be avare of the default recoursion depth in python wich is 1000. you can get and set the recoursion limit hrough importing the "sys" module and using getrecoursionlimit() and setrecoursionlimit().
On Apr 13, 9:16 am, "Jia Lu" <[EMAIL PROTECTED]> wrote: > > for m in test: > > for n in test: > > for o in test: > > for p in test: > > print m+n+o+p > > Thanx for your anwser. > But if I consider about a combination of over 26 letter's list just > like: > "abcdefssdzxcvzxcvzcv" > "asllxcvxcbbedfgdfgdg" > ..... > > Need I write 26 for loops to do this? > > Thanx > > Jia LU -- http://mail.python.org/mailman/listinfo/python-list
