Optimization of code

[new_coder]

Hi,

I need some help regarding the following code.

public static void main(String[] args) throws IOException {

//int mindiff = 100 , k = 0, diff = 0;
String wordList[], words[];
breathalyzer b = new breathalyzer();

wordList = b.readWordList();
words = b.readInput(args[0]);
int m[] = new int[wordList.length];
int i,j;
for(i=0; i<words.length; i++)
{
for(j=0; j<wordList.length; j++)
{
if(words[i] != null && wordList[j] != null)
{

m[j] = b.wordDifference(words[i] , wordList[j]);
}
}
}

}//End of main

What I want is I am storing the word difference between 2 strings in an array m. and I want the least value from that array. the problem is that array is very big. so sorting it takes time. can anyone suggest how do i get the least word diff in shorter time?

i wouldn't mind not using an array for this.

[dlorde]

Why not store them in a SortedSet instead of an array? That way, they'd always be sorted...

Alternatively, you could loop over the array storing the minimum word diff as you go. It would probably be faster than sorting the whole list.

[new_coder]

great idea...will try that. but i hvnt used sortedset before.
can you please tell me how to use it.

[Fubarable]

new coder, please do not double-post or cross-post a question. This is against the forum rules you agreed to on joining us and is not good forum etiquette. Thanks for your cooperation.

[dlorde]

... i hvnt used sortedset before.
can you please tell me how to use it.

Just like any other SDK class - you go to the API docs (SortedSet), read them, and find the most suitable class that implements the interface (probably TreeSet). You then read the docs and look at the available methods you can use. It's a Collection class, so it basically works like any other Collection, but has its own special methods too.