java中的冒泡排序

public class Fibonacci {public static void main(String[] args) {//冒泡int []array={2,1,3,5,0,22,55,66,88,77};for(int i=0;i<array.length;i++){System.out.print(array[i]+",");for (int j = i+1; j < array.length; j++) {if(array[i]<array[j]){int temp=array[i];array[i]=array[j];

array[j]=temp;}}}System.out.println("");System.out.print("排序之后：");for (int i = 0; i < array.length; i++) {System.out.print(array[i]+",");}}}