java冒泡排序法

public class test_data {

    /**冒泡排序
     * @param args
     */
    public static void main(String[] args) {

        //测试数据
        int[] ints=new int[100];
        
        for (int i = 0; i < ints.length; i++) {
            
            ints[i]=(int) Math.round(Math.random()*100);
        }
        
        System.out.println("---------------------------");
        
        for (int i =0 ; i < ints.length-1; i++) {
            
            for (int j = 0; j < ints.length-1; j++) {
                
                if(ints[j]>ints[j+1]){
                    
                    int temp=ints[j];
                    
                    ints[j]=ints[j+1];
                    
                    ints[j+1]=temp;
                }
            }
        }
        
        
        for (int i = 0; i < ints.length; i++) {
            int j = ints[i];
            System.out.println(j);
            
        }
        
        
    }

}