public class T20131210 {
public static void main(String[] args) {
int test[] = { 0, 24, 2, 10, 7, 44, 3 };
冒泡排序(test);
for (int a = 0; a < test.length; a++) {
System.out.println(test[a]);
}
}
public static void 冒泡排序(int sort[]) {
for (int m = 0; m < sort.length - 1; m++) {
for (int n = m; n < sort.length - 1; n++) {
int temp;
if (sort[m] > sort[n + 1]) {
temp = sort[m];
sort[m] = sort[n + 1];
sort[n + 1] = temp;
}
}
}
}
}
//最大操作数=(1+n)*n/2
//所以时间复杂度为O(n^2)
//结果:
//0
//2
//3
//7
//10
//24
//44
冒泡排序(JAVA)
最新推荐文章于 2024-06-07 09:15:00 发布