用Java语言表达冒泡排序–冒泡排序例子
/**
* author:pangwu
* program name:Bubble Sort
*/
package com.pangwu;
public class BubbleSort {
public static void main(String[] args) {
int[] arr = {6, 12, 67, 9, 1, 23, 4, 15, -2, 5};
System.out.println("排序前:");
for (int i = 0; i < arr.length; i++)
System.out.print(arr[i] + " "); //输出原始顺序
System.out.println(" ");
for (int i = 0; i < arr.length; i++) { //比较轮数,每轮确定一个数的位置
for (int j = 0; j < arr.length-1; j++) { //相邻数的比较
if (arr[j] > arr[j + 1]) {
int change;
change = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = change;
}
}
}
System.out.println("排序后:");
for (int i = 0; i < arr.length; i++)
System.out.print(arr[i] + " ");
}
}
运行结果:
注意length-1改为length-i更合适,可以使程序运行时少几次比较。
我在这里就不改了,我比较懒(>_<)