| Anagrams |
You are to write a program that has to generate all possible distinct permutations from a given set of letters.
Example: Given the word "abc", your program should output the words "abc", "acb", "bac", "bca", "cab" and "cba". They should be printed one to a line, with no additional whitespace (other than the trailing newline.)
In the word taken from the input file, some letters may appear more than once. For a given word, your program should not produce the same word more than once, and the words should be output in alphabetically ascending order.
The input file consists of several words. The first line contains a number giving the number of words to follow. Each following line contains one word. A word consists of uppercase or lowercase letters from A to Z. Uppercase and lowercase letters are to be considered different. Each word will consist of 9 or fewer letters.
For each word in the input file, the output file should contain all different words that can be generated with the letters of the given word. The words generated from the same input word should be output in alphabetically ascending order. (Uppercase letters precede lowercase ones.)
2 abc acba
abc acb bac bca cab cba aabc aacb abac abca acab acba baac baca bcaa caab caba cbaa