Java中运用数组的四种排序方法

<1>利用Arrays带有的排序方法快速排序

 
 
import java.util.Arrays; 2 public class Test2{   
        public static void main(String[] args){   
                int[] a={5,4,2,4,9,1};   
                Arrays.sort(a);  //进行排序   
                for(int i: a){   
                        System.out.print(i);   
               }  
        }  
} 

<2>冒泡排序算法

 
 
public static int[] bubbleSort(int[] args){//冒泡排序算法   
        for(int i=0;i<args.length-1;i++){   
               for(int j=i+1;j<args.length;j++){   
                   if (args[i]>args[j]){   
                       int temp=args[i];   
                       args[i]=args[j];   
                       args[j]=temp;   
                       }   
            }  
       }  
       return args;  
} 

<3>选择排序算法

 
 
public static int[] selectSort(int[] args){//选择排序算法   
         for (int i=0;i<args.length-1 ;i++ ){   
                int min=i;   
                for (int j=i+1;j<args.length ;j++ ){   
                      if (args[min]>args[j]){   
                           min=j;   
                           }   
                  }   
                      if (min!=i){  
                      int temp=args[i];  
                      args[i]=args[min];  
                      args[min]=temp;          
                  }  
            }  
             return args;  
    } 

<4>插入排序算法

 
 
public static int[] insertSort(int[] args){//插入排序算法   
                 for(int i=1;i<args.length;i++){   
                         for(int j=i;j>0;j--){   
                                 if (args[j]<args[j-1]){   
                                         int temp=args[j-1];  
                                         args[j-1]=args[j];  
                                        args[j]=temp;          
                                }else break;   
                        }  
                 }  
                 return args;  
         } 
 
 


 
 
 
 


 
 
 
 


 
 
 
 


 
 
 
 


 
 
 
 

  
  package com.pbh;


public class ChaRuPaiXu {



  
  	public static int[] insertSort(int[] args) {

  
  		for (int i = 1; i < args.length; i++) {

  
  			for (int j = i; j > 0; j--) {

  
  				if (args[j] < args[j - 1]) {

  
  					int temp = args[j - 1];

  
  					args[j - 1] = args[j];

  
  					args[j] = temp;

  
  				} else

  
  					break;

  
  			}

  
  		}

  
  		return args;

  
  	}



  
  	public static void main(String[] args) {

  
  		int[] a = { 5, 4, 2, 4, 9, 1, 443, 23, 1213, 325, 235, -8 };

  
  		insertSort(a);

  
  		for (int b : a) {

  
  			System.out.print(b);

  
  			System.out.print(" ");

  
  		}

  
  	}
}