ArrayList myList;

void setup()
{
    myList = new ArrayList();
    myList.add( new myObject(-1000) );
    myList.add( new myObject(2000) );
    myList.add( new myObject(1) );
    
    Object[] unsorted = myList.toArray();
    Object[] sorted = myList.toArray();
    
    Arrays.sort(sorted, new myObjectComparator());
    
    // or do instead:
    // Arrays.sort(sorted);
    // because the comparable interface is implemented in myObject
    
    println( "unsorted \t sorted" );
    
    for (int i=0; i < unsorted.length; i++)
    {
	  println( ((myObject)unsorted[i]).anInt + " \t " + ((myObject)sorted[i]).anInt );
    }
}

class myObject
implements Comparable
{
    int anInt;
    
    myObject ( int _i )
    {
	  anInt = _i;   
    }
    
    // you can as well use the comparable interface to compare objects.
    // with this there's no need for another comparator class ...
    int compareTo(Object other) throws ClassCastException
    {
	  myObject mo = (myObject)other;
	  if ( anInt > mo.anInt ) return 1;
	  else if ( anInt < mo.anInt ) return -1;
	  return 0;
    }
}

class myObjectComparator
implements Comparator
{
    int compare(Object o1, Object o2) 
    {
	  myObject mo1 = (myObject)o1;
	  myObject mo2 = (myObject)o2;
	  if ( mo1.anInt > mo2.anInt ) return 1;
	  else if ( mo1.anInt < mo2.anInt ) return -1;
	  return 0;
    }
}