Java.util.Arrays.sort for Vector

Question

I used the java.util.Arrays.sort to sort an array based on the method below.
              java.util.Arrays.sort(array, 0, total, new ComparatorX());
           repaint();
            class ComparatorX implements java.util.Comparator
          public int compare( Object p1, Object p2){
               int x1=((Point)p1).x;
               int x2=((Point)p2).x;
               if(x1>x2)
                            return 1;
               if(x1>x2)
                            return -1;
               return 0;
     }I've since changed the array to a vector. Is there anyway I can keep the comparator. Or how can I sort the vector based on the above method.

Answer 1

BTW: Don't know if it's just a typing mistake, but your code contains an error:
class ComparatorX implements java.util.Comparator     {
   public int compare( Object p1, Object p2) {
      int x1=((Point)p1).x;
      int x2=((Point)p2).x;
      if (x1>x2) {
         return 1;
      if (x1>x2) {  // Should be: if (x2 > x1) ...
         return -1;
      return 0;