JAVA中的冒泡排序算法

int[] arr = new int[]{33,5,22,-98,6,-76,0,-5}; for (int i = 0; i < arr.length-1;i++) { for(int j =0;j < arr.lenth-1-i;j++) { if(arr[j] > arr[j+1]) { int temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } }