冒泡排序

int[] scorce={12,83,7,87,78,9,90,15};for (int i = 0; i <scorce.length-2 ; i++) {    for (int j = 0; j < scorce.length-i-1; j++) {        if(scorce[j]>scorce[j+1])        {            int temp=scorce[j];            scorce[j]=scorce[j+1];            scorce[j+1]=temp;        }    }}StringBuffer buffer=new StringBuffer("排好序为");for (int i = 0; i < scorce.length; i++) {    buffer.append(scorce[i]+";");}TextView tv=new TextView(this);tv.setText(buffer.toString());setContentView(tv);