算法导论学习笔记(1)----插入排序

//升序排列
#include <iostream>
using namespace std;


int main()
{
    int a[5]={1,5,2,3,4};

    for (int i=1;i<5;i++)
    {
        int 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<5;i++)
    {
        cout<<a[i];
    }
    getchar();
};



//降序排列

#include <iostream>
using namespace std;

int main()
{
int a[5]={1,5,2,3,4};

for (int i=1;i<5;i++)
{
int 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<5;i++)
{
cout<<a[i];
}
getchar();
};