概要：
Java 冒泡排序
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
package net.xsoftlab.baike;
/** * @desc 冒泡排序实现
*/
public class Sort {
private int[] num = { 4, 3, 2, 1, 5 };
public void sort() {
int tmp = 0;
for (int i = num.length - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (num[j] > num[j + 1]) {
tmp = num[j + 1];
num[j + 1] = num[j];
num[j] = tmp;
}
}
}
}
public void print() {
for (int i : num) {
System.out.println(i);
}
}
public static void main(String args[]) {
Sort t = new Sort();
t.sort();
t.print();
}
}
|