All possible words?

Question

I want to create all possible 5 letter words using a-z.Please suggest any good and fast algorithms. I have tried creating one and it looks something like this... byte[] allchar=new byte[] {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'}; int lengthOfAllChar=allchar.length; System.out.println(lengthOfAllChar); for (int i = 0; i < lengthOfAllChar; i++){ for(int j = 0; i < lengthOfAllChar; j++){ StringBuffer finalWordBuffer = new StringBuffer(); finalWordBuffer.append((char)allchar[i]); finalWordBuffer.append((char)allchar[j]); } }

Answer 1

Letters can be repeated.... you are going to need FIVE (5) nested for loops.... for real!!!

Sorry, but it is what it is....

==============================================

class FiveLetterWords

{

// there are 26^5 = 11,881,376 possible words since letters can be repeated

public static void main(String args[])

{

for (int iLoop1= 65; iLoop1<=90; iLoop1++)

{

for (int iLoop2=65; iLoop2<=90; iLoop2++)

{

for (int iLoop3=65; iLoop3<=90; iLoop3++)

{

for (int iLoop4=65; iLoop4<=90; iLoop4++)

{

for (int iLoop5=65; iLoop5<=90; iLoop5++)

{

char [] chArray = new char[5];

chArray[0] = (char)(iLoop1);

chArray[1] = (char)(iLoop2);

chArray[2] = (char)(iLoop3);

chArray[3] = (char)(iLoop4);

chArray[4] = (char)(iLoop5);

String str5 = new String(chArray);

System.out.println(str5);

} //iLoop5

} //iLoop4

} //iLoop3

} //iLoop2

} //iLoop1

} //main

} //class