In plain english please...

Question

Can anybody explain to me the logic behind this sort algorithm using a comparator?
I don't understand the usage of "o1" and "o2", and I also don't understand why 1, -1, and 0 are returned and what is done with those values if they are returned.
Thanks.
java.util.Arrays.sort(names, new java.util.Comparator<String[]>() {
public int compare(String[] o1, String[] o2) {
if(Integer.parseInt(o1[1]) > Integer.parseInt(o2[1])) {
return 1;
} else if(Integer.parseInt(o1[1]) < Integer.parseInt(o2[1])) {
return -1;
} else {
return 0;
}

Answer 1

One question though, if I wanted to compare and sort
more than 2 items in a column in my 2d array, would I
have to compare o0 to o1, o1 to o2, o2 to o3, and so
on?If you're writing compare/compareTo, no. If you're writing sort method, yes.
Your compareTo method (Comparable) or compare method (Comparator) is only responsible for comparing two things. The sort routine--Collections.sort or Arrays.sort--is responsible for ivoking your compare method on the various pairs of items in order to get the list or array sorted.
The meat of the work of sorting is done by the sort method. It has the logic, "if A < B then swap A and B," etc. all you're doing in compare/compareTo is answering the sort method's question "Is A < B?"
These may be the same online tutorials that you found cryptic, but look at these and see if they help.
Making Java Objects Comparable
http://java.sun.com/docs/books/tutorial/collections/interfaces/order.html
http://www.javaworld.com/javaworld/jw-12-2002/jw-1227-sort.html