sorting

java.util.Comparator comp = new customComparator();
 TreeSet set = new TreeSet(comp);
 
 for(int i=0;i<items.length;i++)
 {
 
  Vector vec = new Vector();
 
 
  vec.add("a");
  vec.add("b");
 
  set.add(vec);
 
 }
 
 
 
 
public class customComparator implements java.util.Comparator{
 
 
public int compare(Object o1, Object o2)
{
Vector vec1 = (Vector) o1;
Vector vec2 = (Vector) o2;
 
String a = (String)vec1.firstElement();
String b = (String)vec2.firstElement();
 
if(a.equals(b))
   return 0;
 
TreeSet set = new TreeSet();
set.add(a);
set.add(b);
 
String temp = (String)set.first();
 
if(a.equals(temp))
   return -1;
else
   return 2;
 
}        
 
 
public boolean equals(Object obj){
 return true;
}
 
}