Hi All, I am just a new user in this forum and need a help. I have a name e.g Aeäae here ä is a latin special character where ä is equal to ae or Ae or Ä. Now I have to generate all permutation and combination of given name(Aeäae) for example Aeäae AeÄae AeAeae Aeaeae ääae Ääae and so on. basically combination would be 64 its because of 4³(here 4 is replacement character and 3 is length of name() ). Please help me how to right a program in C++/VC++/MFC to generate all this 64 combinations. please help :nonod::nonod::nonod: