题目:
解析:
代码:
import java.io.*;
public class Java_3{
public static int data[]={32,18,41,23,2,56,36,67,59,20};
public static void main(String args[]){
int i;
//*********Found**********
int index=data.length;
System.out.println("排序前:");
for(i=0;i<index;i++)
System.out.print(" "+data[i]+" ");
System.out.println();
//*********Found**********
BubbleSort( index );
System.out.println("排序后:");
for(i=0;i<index;i++)
System.out.print(" "+data[i]+" ");
System.out.println();
}
// 冒泡法排序
public static void BubbleSort(int index){
int i,j;
int temp;
for(j=1;j<index;j++){
for(i=index-1;i>=j;i--){
if(data[i]<data[i-1]){ //比较相邻的两个数
temp=data[i];
data[i]=data[i-1];
//*********Found**********
data[i-1]= temp ;
}
}
}
}
}