import java.util.ArrayList;

class SelSort 
{
 public static <T extends Comparable<? super T>> void sort(ArrayList<T> a)
 {
  for(int i=0; i<a.size()-1; i++)
     {
      int pos = findMinPos(a,i);
      swap(a,i,pos);
     }
 }

 private static <T extends Comparable<T>> int findMinPos(ArrayList<T> a,int pos)
 {
  for(int i=pos+1; i<a.size(); i++)
     if(a.get(i).compareTo(a.get(pos))<0)
        pos=i;
  return pos;
 }

 private static <T> void swap(ArrayList<T> a,int pos1,int pos2)
 {
  T temp = a.get(pos1);
  a.set(pos1,a.get(pos2));
  a.set(pos2,temp);
 }

}