Wednesday, May 20, 2009

JavaOne Talk: Word Sort

See this post about why this code is being shown. This is a different algorithm than the previous examples, so once again I will start with the Java version. The program takes a file name, and reads the file into memory. The file contains a list of randomly generated words, separated by spaces. The program does a case-insensitive sort of all of the words. Here is the Java "reference" implementation:

import java.util.*;

public class WordSort {
private final File dataFile;
private final List<String> words;
public WordSort(String fileName){
dataFile = new File(fileName);
words = new ArrayList<String>();

public List<String> getSortedWords(){
if (words.size() > 0){
return words;
try {
BufferedReader reader = new BufferedReader(new FileReader(dataFile));
String line;
while ( (line = reader.readLine()) != null){
for (String string : line.split(" ")){
} finally {
Collections.sort(words, new Comparator<String>(){
public int compare(String s, String s1) {
return s.toLowerCase().compareTo(s1.toLowerCase());
return words;
} catch (IOException e) {
throw new RuntimeException(e);

No comments: