冒泡排序法列子

//int类型数组
int [ ] arr = {
    
    8,1,32,63,87,22,52,41 };

public static void bubbleSort(int [ ] arr){
    
    
for(int i = 0; i < arr.length; 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;
    	   }
	   }
	}
}