冒泡排序算法

//冒泡排序
public class demo{

public static void main(String [] args){

   int [] array = {1,5,3,8,9,23,51,22};   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]){              int temp=array[j+1];              array[j+1]=array[j];              array[j]=temp;

}
}
}
for(int i=0;i