java 冒泡排序

        int num[] = {55,12, 34 ,52,66};         int temp;

        for(int i = 0; i<num.length;i++){             for (int j = 0; j<num.length-i-1;j++)             {                 if(num[j]>num[j+1]){                     temp = num[j];                     num[j] = num[j+1];                     num[j+1]=temp;                 }             }         }