浅看插入排序

插入排序

升序：

#include<iostream>
using namespace std;

int main()
{
    int A[6] = { 31,41,59,26,41,3};
    int key;
    //从第二位开始 与前面的所有数进行比较
    for (int i = 1; i < 6; i++) {
        key = A[i];
        int j = i - 1;
        while (j>=0&&A[j]>key){
            A[j + 1] = A[j];
            --j;
        }
        A[j + 1] = key;
    }
    for (int i = 0; i < 6; i++) {
        cout << A[i] << " ";
    }
    cout<<endl;
    return 0;
}

降序：

#include<iostream>
using namespace std;

int main()
{
    int A[6] = { 31,41,59,26,41,3};
    int key;
    //从倒数第二位开始 与前面的所有数进行比较
    for (int i = 4; i >= 0; i--) {
        key = A[i];
        int j = i + 1;
        while (j<=5&&A[j]>key){
            A[j - 1] = A[j];
            ++j;
        }
        A[j-1] = key;
    }
    for (int i = 0; i < 6; i++) {
        cout << A[i] << " ";
    }
    cout<<endl;
    return 0;
}