插入排序

 

int arr[] = {3,6,1,4,7,0,2,9,12};

void insertion_sort(){
    for(size_t i=1;i!=sizeof(arr)/sizeof(int);++i){
        int key = arr[i];
        size_t j=i-1;
        while(j>=0&&arr[j]>key){
            arr[j+1] = arr[j--];
        }
        arr[j+1] = key;
    }
}

void print(){
    for(size_t i=0;i!=sizeof(arr)/sizeof(int);++i){
        cout<<arr[i]<<","<<flush;
    }
}