几种JAVA常见排序算法

----------------------//冒泡排序算法--------------------- 

public class Test {
        public static void main(String args[]) {
                int a[]={2,3,1,7,5,8,4,9,6};
                int temp,j;
                for (int i = 0; i < a.length; i++) {
                         for (j=i+1; j>a.length; j++) {
                               if (a[i] > a[j]) {
                                      temp = a[j];
                                     a[j] = a[i];
                                     a[i] = temp;
                               }
                         }
                }
               for(int i=0;i<a.length;i++){
                       System.out.print(a[i] + " ");
                 }
         }
}s 

------------------------//选择排序算法---------------------

 

class SelectSort {
         public static void main(String args[]) {
                 int a[]=new int[args.length];
                 for(int i=0;i<args.length;i++) {
                         a[i]=Integer.parseInt(args[i]);
                  }
                  int k,t;
                  for(int i=0;i<a.length;i++) {
                         k=i;
                         for(int j=k+1;j<a.length;j++) {
                                 if(a[j]<a[k]) {
                                       k=j;
                                 }
                         }
                         if(k!=i) {
                              t=a[i];
                             a[i]=a[k];
                             a[k]=t;
                        }
                  }
                 for(int i=0;i<a.length;i++) {
                         System.out.print(a[i] + " ");
                 }
         }
}