冒泡排序

private static void maopao(){int a[]={7,3,4,-1,8,1,2};for(int i=a.length-1;i>=0;i--){for(int j=0;j<=i;j++){if(a[i]<a[j]){a[i]=a[i]+a[j];a[j]=a[i]-a[j];a[i]=a[i]-a[j];}}for(int jj=0;jj<a.length;jj++){System.out.print(a[jj]+" ");}System.out.println();}}