各种排序算法之插入排序

public static void main(String args[]){
    System.out.println("随机数组:");
    int [] dataArray=new int[10];
    int number = 10;
    for (number = 0; number < dataArray.length; number++) {
        Random random = new Random();
        dataArray[number] = random.nextInt(100);
    }
    System.out.println("排序前的随机数组:"+Arrays.toString(dataArray));
    for(int i = 1; i < number; i++){
        int j = i-1;
        int temp = dataArray[i];
        while (j >= 0 && dataArray[j]>temp) {
            dataArray[j+1] = dataArray[j];
            j--;
        }
        if (j != i-1) {
            dataArray[j+1]=temp;
        }
    }
    System.out.println("排序后的随机数组:"+Arrays.toString(dataArray));
}

}