Java help

/*************************************************************************** * * A class to sort RomanNumerals. * Project 1, CSCI 212 * * @author K. Lord * */ public class RomanNumeralSort { /** * Sorts an array containing Roman Numerals in ascending order * * @param numerals Partially-filled array of RomanNumerals * @param size The size of the array that is filled. */ public static void sort(RomanNumeral[] numerals, int size) { // // Selection Sort. // Find the smallest value in the array and swap it with the // top value. Continue this process starting at successive // cells in the array. for (int i = 0; i < size - 1; ++i) { int indexLowest = i; for (int j = i + 1; j < size; ++j) { if (numerals[j].compareTo(numerals[indexLowest]) < 0) indexLowest = j; } RomanNumeral temp = numerals[indexLowest]; numerals[indexLowest] = numerals[i]; numerals[i] = temp; } } }