//排序方式
public class Paixu {
public static void main(String args[]) {
// 插入排序,拿固定数向前比较,数固定不变,但位置不断前移
int[] a = { 21, 32, 43, 5, 67, 87, 98, 45, 23 };
for (int i = 0; i < a.length; i++) {
int k = a[i];
int j;
for (j = i - 1; j >= 0 && (k < a[j]); j--) {
a[j + 1] = a[j];
}
a[j + 1] = k;
}
System.out.println(Arrays.toString(a));
// 从前向后依次比较排序,拿每一个数向后比较(推动)
int[] b = { 21, 32, 43, 5, 67, 87, 98, 45, 23 };
for (int i = 0; i < b.length - 1; i++) {
for (int j = i + 1; j < b.length; j++) {
if (b[i] > b[j]) {
int t = b[i];
b[i] = b[j];
b[j] = t;
}
}
}
System.out.println(Arrays.toString(b));
// 冒泡:从后向前先排前(先得到最小数)
int[] c = { 21, 32, 43, 5, 67, 87, 98, 45, 23 };
for (int i = 0; i < c.length; i++) {
for (int j = c.length - 1; j > i; j--) {
if (c[j] < c[j - 1]) {
int t = c[j];
c[j] = c[j - 1];
c[j - 1] = t;
}
}
}
System.out.println(Arrays.toString(c));
// 冒泡:从前向后先排后(先得到最大数)
int[] d = { 21, 32, 43, 5, 67, 87, 98, 45, 23 };
for (int i = 0; i < d.length; i++) {
for (int j = 0; j <d.length-i-1 ; j++) {
if (d[j] > d[j + 1]) {
int t = d[j];
d[j] = d[j + 1];
d[j + 1] = t;
}
}
}
System.out.println(Arrays.toString(d));
}
}
JAVA排序
最新推荐文章于 2023-06-26 16:09:50 发布