冒泡排序

//冒泡法

时间复杂度:    O(n^2)
稳定性：稳定

package kill;
import java.util.Arrays;
public class TestDemo1 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        
        //int []array ={3,8,9,6,4,2,7};
        int[] array=new int[10000];
        for(int i = 0;i < array.length;i++){
            array[i] = (int)(Math.random()*10+1);
        }
        bubbleSort(array);
        System.out.println(Arrays.toString(array));
    }
    public static void bubbleSort(int[] array){
        System.out.println(System.currentTimeMillis()); //开始语句
        int tmp = 0;
        for(int i = 0;i < array.length-1;i++){//趟数
            
            for(int j = 0;j < array.length-1-i;j++){//次数
                if(array[j] > array[j+1]){
                    tmp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = tmp;
                }
            }
    }System.out.println(System.currentTimeMillis());//结束语句  用来计算时长
}
}