QUOTE(imamkomc @ 30 Jul, 2007 - 05:30 AM)
Hi ships04,
I understood you problem, but if you not effort write your code program.
i dont know where erors getting.
I think total of all possible string output is result nxn.
Hi I cant start writing the code if I dont know what I am doing... I mean I need to work out some kinda algorithm or psuedocode first - that is where I am stuck... I have mentioned a couple of my ideas but those ideas dont work - i mean they dont make sense so I am asking if you guys have any ideas??
QUOTE(Amadeus @ 30 Jul, 2007 - 06:34 AM)
I think he means to define alphabet by the array Z, and provide variable n which would represent the number of characters in the string,and get all the permutations against that.
In the example above, Z is the character array, while n would be three. Z could be any number of letters.n could be any integer.
yea your write - thats exactly what I mean, Z could be any kinda array and of any length - it would be some random numbers or characters or symbols like Z = { 1, 5, 7} or Z = { $, #, /, 8 }... and output shud be the permutations... by the way i am a female...
| 