Here is what i have now ... i fixed the problem where i was losing words ... now all i have left to do is sort my array from occurs most often to occurs least often with the words with the same number of occurences in alphabetical order .... if i can get that i will be done.
here's my code
[B]import[/B] javax.swing.JOptionPane;
[B]import[/B] javax.swing.JFileChooser;
[B]import[/B] java.util.Scanner;
[B]import[/B] java.util.StringTokenizer;
[B]import[/B] java.io.*;
[B]public[/B][B]class[/B] Assn2_5jnv {
[B]public[/B] [B]static[/B] String bigAssStringMaker (Scanner txtFile){
String bigAssString = [B]new[/B] String();
txtFile.radix();
[B]while[/B](txtFile.hasNextLine()){
bigAssString = bigAssString + txtFile.nextLine();
}
[B]return[/B](bigAssString);
}
[B]public[/B] [B]static[/B] [B]int[/B] wordCount (Scanner fileText){
String bigString;
[B]int[/B] count = 0;
bigString = [I]bigAssStringMaker[/I](fileText);
StringTokenizer temp = [B]new[/B] StringTokenizer(bigString, " 0123456789,.;:–-!$?()[]&#\'\"\t\n");
[B]while[/B](temp.hasMoreTokens()){
count++;
temp.nextToken();
}
[B]return[/B](count);
}
[B]public[/B] [B]static[/B] [B]void[/B] fileToArray (Scanner textFile, String[] importString){
[B]int[/B] k = 0;
String largeString;
largeString = [I]bigAssStringMaker[/I](textFile);
StringTokenizer toke = [B]new[/B] StringTokenizer(largeString, " 0123456789,.;:–-!$?()[]&#\'\"\t\n");
[B]while[/B](toke.hasMoreTokens()){
importString[k] = toke.nextToken();
k++;
}
}
[B]public[/B] [B]static[/B] [B]void[/B] sortArray(String[] alphabeticalArray){
[B]int[/B] index, indexOfNextSmallest;
[B]int[/B] numberUsed = alphabeticalArray.length;
[B]for[/B](index = 0; index < numberUsed; index++){
indexOfNextSmallest = [I]indexOfSmallest[/I](index, alphabeticalArray, numberUsed);
[I]interchange[/I](index, indexOfNextSmallest, alphabeticalArray);
}
}
[B]public[/B] [B]static[/B] [B]int[/B] indexOfSmallest([B]int[/B] startIndex, String[] speechArray, [B]int[/B] numberUsed){
String min = speechArray[startIndex];
[B]int[/B] indexOfMin = startIndex;
[B]int[/B] index;
[B]for[/B](index = startIndex + 1; index < numberUsed; index++){
[B]if[/B](speechArray[index].compareToIgnoreCase(min)<0){
min = speechArray[index];
indexOfMin = index;
//min s the smallest of speechAray[startIndex] through speechArray[index]
}
}
[B]return[/B](indexOfMin);
}
[B]public[/B] [B]static[/B] [B]void[/B] interchange([B]int[/B] i, [B]int[/B] j, String[] array){
String temp = [B]null[/B];
temp = array[I];[/I]
[i]array[I] = …