Java implementation Voctor to sort the samples in a specified way share _java

Copy Code code as follows:

Import java.util.*;
Class Mycompare implements Comparator//implementation Comparator, define your own comparison method
{
public int Compare (object O1, Object O2) {
Elem e1= (Elem) O1;
Elem e2= (Elem) O2;

if (E1.get () > E2.get ()) The comparison is descending, if 1 to 1 is ascending.
{
return-1;
}
else if (E1.get () <e2.get ())
{
return 1;
}
Else
{
return 0;
}
}
}
Class Elem {
private int ival;
Public Elem (int i) {
This.ival = i;
}
public int get () {
return this.ival;
}
}
public class Vector1 {
public static void Main (string[] args) {
List v = new Vector ();
V.add (New Elem (1));
V.add (New Elem (22));
V.add (New Elem (3));
V.add (New Elem (14));
Comparator ct = new Mycompare ();
Collections.sort (v, CT);
for (int i = 0; i < v.size (); i++)
System.out.println (((Elem) v.get (i)). get ());
}
}