简单插入排序的实现

#include<iostream> 
using namespace std; 
void insertsort(int a[],int n) 
{ 
    int i,j; 
    for(i = 1;i < n;i ++ ) 
        { 
            int tmp = a[i]; 
            for(j = i;j > 0 && tmp < a[j-1];j --) 
                a[j] = a[j-1]; 
            a[j] = tmp; 
        } 
} 
int main() 
{ 
    int a[10] = {3,6,1,9,4,5,2,7,0,8}; 
    insertsort(a,10); 
    for(int i = 0;i < 10;i ++) 
        cout<<a[i]<<" "; 
    cout<<endl; 
    return 0; 
}