基准排序的 原理:以第i个数为基准,从第i+1个数到最后一个数依次和第i个数比较,如果小于,就互换
代码:
package com.algorithm.sort;
public class JizhunSort {
public static void main(String[] args) {
int a[] = { 3, 7, 4, 9, 5, 2, 6, 1 };
printArray(a);
Jizhun(a);
printArray(a);
}
public static void Jizhun(int[] x) {
int temp = 0;
for (int i = 0; i < x.length - 1; i++) {
for (int j = i + 1; j < x.length; j++) {
if (x[i] > x[j]) {
temp = x[i];
x[i] = x[j];
x[j] = temp;
}
}
printArray(x);
}
}
public static void printArray(int[] x) {
for (int a : x)
System.out.print(a + " ");
System.out.println();
}
}
执行结果:
3 7 4 9 5 2 6 1
1 7 4 9 5 3 6 2
1 2 7 9 5 4 6 3
1 2 3 9 7 5 6 4
1 2 3 4 9 7 6 5
1 2 3 4 5 9 7 6
1 2 3 4 5 6 9 7
1 2 3 4 5 6 7 9
1 2 3 4 5 6 7 9