数组的排序

选择法正排序

for (int i = 0; i < a.length; i++) {
    for (int j = i + 1; j < a.length; j++) {
        if(a[i] > a[j]) {
            b = a[i];
            a[i] = a[j];
            a[j] = b;
        }
    }
}

for (int i = 0; i < a.length; i++) {
    int k = i;
    for (int j = i + 1; j < a.length; j++) {
        if(a[k]>a[j]) {
            k = j;
        }
    }
    if(k != i) {
        b = a[i];
        a[i] = a[k];
        a[k] = b;
    }
}

冒泡法倒排序

for (int i = 0; i < a.length; i++) {
    for (int j = 0; j < a.length - i - 1; j++) {
        if(a[j] > a[j + 1]) {
            b = a[j];
            a[j] = a[j + 1];
            a[j + 1] = b;
        }
    }
}

数组的排序

原文：https://www.cnblogs.com/huochemeiyouhuo/p/12382149.html