public void insertionSort() {
int in, out;
for (out = 0; out < A.length-1; out++) {
for (in = out + 1; in > 0; in--) {
if (A[in] < A[in - 1])
swap(A, in, in - 1);
}
}
}
Java实现插入排序
最新推荐文章于 2022-04-30 10:31:20 发布
public void insertionSort() {
int in, out;
for (out = 0; out < A.length-1; out++) {
for (in = out + 1; in > 0; in--) {
if (A[in] < A[in - 1])
swap(A, in, in - 1);
}
}
}