java经典冒泡排序
/**
* @Description:冒泡算法
* @Author: zhangke
* @Date: 2020/7/16 14:41
*/
public class test {
public static void main(String[] args) {
int a[] = {9,23,11,55,45,26,59,27,84,79,55};
int i,temp;
System.out.println("初始序列的数组为:");
for(i=0;i<a.length;i++){
System.out.print(a[i]+",");
}
for(i=0;i<a.length-1;i++){
for( int j =0; j< a.length- i-1; j++) {
if(a[j]>a[j+1]) {
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
System.out.println("\n排好序的数组为:");
for(i=0;i<a.length;i++){
System.out.print(a[i]+",");
}
}
}
下面是结果
从小到大a[j]>a[j+1]
从大到小a[j]<a[j+1]