insertionsort

别人推荐去看算法导论，今天就开始学习了

#include <stdio.h>
void insertionsort(int *a,int n)
 {
     int i,j;
     int key;
     for(i=1;i<n;i++)
     {
         key=a[i];
         j=i-1;
         while(j>=0&&a[j]>key)
         {
             a[j+1]=a[j];
             j=j-1;
         }
        a[j+1]=key; 
     }
 }
int main()
{
    int n;
    int i=0; 
    int arry[100];
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&arry[i]);
    }
    insertionsort(arry,n);
    i=0;
    while(n--)
    {
        printf("%d\n",arry[i]);
        i++;
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/jlxjq/p/5363127.html