sort排序

数字、字符串排序算法

public static void main(String[] args){
  Integer[] a ={5,1,9,4,6,2,0,3,8,7};
  String[] b={"Chongqing","Shanghai","AoMen","TianJin","Beijing","XiangGang"};
  Double[] c={8.5,6.3,1.7,9.2,0.5,2.3,4.1,7.4,5.9,3.7};
  int i;
  ArrayList<Integer> A = new ArrayList<Integer>();
  for(i=0;i<10;i++){
   A.add(a[i]);
  }
  Vector<String> B = new Vector<String>();
  for(i=0;i<6;i++){
   B.add(new String(b[i]));
  }
  LinkedList<Double> C =new LinkedList<Double>();
  for(i=0;i<10;i++){
   C.add(c[i]);
  }
  Sort.insertionSort((List)A);
  System.out.println(A);
  Sort.insertionSort((List)B);
  System.out.println(B);
  Sort.insertionSort((List)C);
  System.out.println(C);
 }
 public static void insertionSort(int[] a){
  int i,j,key, n = a.length;
  for(j=1;j < n;j++){
   key=a[j];
   i=j-1;
   System.out.println("j-1="+(i));
   while(i>=0&&a[i]>key){
    System.out.println("i="+(i));
    a[i+1] = a[i];
    i--;
   }
   a[i+1]=key;
  }
 } 
 //唯一的参数a由基本整型数据改为Comparable型的数组。这样，所有、
 //实现（implements)了Comparable接口的类的对象作为数组元素都能用此方法排序
 @SuppressWarnings({ "rawtypes", "unchecked" })
 public static void insertionSort(Comparable[] a){
  int i,j,n=a.length;
  Comparable key;
  for(j=1;j<n ;j++){
   key= a[j];
   i=j-1;
   while(i>=0 && a[i].compareTo(key) >0){
    a[i+1]=a[i];
    i--;
   }
   a[i+1]=a[i];
  }
 }
 //任意可比较类型表容器版本
 @SuppressWarnings({ "rawtypes", "unchecked" })
 public static void insertionSort(List<Comparable> a){
  int i,j,n=a.size();
  Comparable key;
  for(j=1;j<n;j++){
   key =a.get(j);
   i=j-1;
   while(i>=0&&(a.get(i)).compareTo(key)>0){//i>=0,a[i]>key
    a.set(i+1, a.get(i));
    i--;
   }
   a.set(i+1, key);
  }
 }
运行结果如下：

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
[AoMen, Beijing, Chongqing, Shanghai, TianJin, XiangGang]
[0.5, 1.7, 2.3, 3.7, 4.1, 5.9, 6.3, 7.4, 8.5, 9.2]