JAVAOooooo。。。。。ooo0000OOOOO

package cn.itcast.day04.demo01;
import java.util.Arrays;
public class maopao {
public static void main(String[] args) {
int[] arr = {10,400,666,21,9};
System.out.println(“排序前：”+Arrays.toString(arr));

        **//arr.length不减1 的话就要索引越界异常
  **/*      for (int i = 0; i < arr.length-1-0; i++) {//Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 5
          if (arr[i]>arr[i+1]){ //i+1 越界
              int temp =arr[i];
              arr[i] = arr[i+1];
              arr[i+1] = temp;
          }
        }
        System.out.println("第一次排序后："+ Arrays.toString(arr));
        for (int i = 0; i < arr.length-1-1; i++) {
            if (arr[i]>arr[i+1]){
                int temp =arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = temp;
            }
        }
        System.out.println("第二次排序后："+ Arrays.toString(arr));
        for (int i = 0; i < arr.length-1-2; i++) {
            if (arr[i]>arr[i+1]){
                int temp =arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = temp;
            }
        }
        System.out.println("第3次排序后："+ Arrays.toString(arr));
        for (int i = 0; i < arr.length-1-3; i++) {
            if (arr[i]>arr[i+1]){
                int temp =arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = temp;
            }
        }
        System.out.println("第4次排序后："+ Arrays.toString(arr));*/****

    for (int i= 0; i < arr.length-1; i++) {
        for (int j = 0; j < arr.length-1-i; j++) {
            if (arr[j]>arr[j+1]){
                int temp =arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
    System.out.println("排序后："+ Arrays.toString(arr));

}

}