I am currently writing a program in which you input a word and the program then outputs all of the different ways the characters can be moved round into anagrams. I have wrote a way of turning the command line argument into a char array using the toCharArray() now I need to write a boolean array to see if the character has been used before. Any help?
Whether the use of the boolean array is right depends on what is the algorithm you are implementing. There's no clue as to your intended algorithm, so no way for anyone to comment.
Do you have a written description of the algorithm? Do you have it in your head? Could you use it with pencil & paper if someone gave you an arbitrary word?
If you can't answer "yes" to at least one of those questions then it's too soon to be coding anything.
ps: The obvious way to do this involves recursion, but there are bound to be other ways as well.