public class MyClass implements Comparable { public int compareTo(Object o) { // If this < o, return a negative value // If this = o, return 0 // If this > o, return a positive value } }
You are here: Home > java > Implementing a Class That Can Be Sorted
Wednesday, June 27, 2007
Implementing a Class That Can Be Sorted
In order for a class to be used in a sorted collection such as a SortedTree or for it to be sortable by Collections.sort(), the class must implement Comparable.