所谓冒泡排序法就是两两进行比较,然后互换这两个数的位置,大的数值向后排,进行多次的相邻两个数值的比较和互换,从而达到排序的目的:
public class SortExample{
public static void main(String[] args){
int i , j;
int[] arrays = {23,12,7,32,28};
int length = arrays.length;
System.out.println(“排序前,数组元素序列是:”);
for(i=0;i<length;i++){
System.out.print(arrays[i] + “ “);
}
System.out.println(“ “);
for(i=0;i<length-1;i++){
for(j=0;j<length-1-i;j++){
int temp=0;
if(arrays[j]>arrays[j+1]){
temp = arrays[j];
arrays[j] = arrays[j+1];
arrays[j+1] = temp;
}
}
}
System.out.println(“排序以后,数组元素序列是:”);
for(i=0;i<length;i++){
System.out.print(arrays[i] + “ “);
}
}
}