insert sort

//algo/insert_sort.cpp
//5,2,4,6,1,3

#include <iostream>
using namespace std;

void in_sort(int list[],int size)
{
    int key;
    int i;
    for(int j=0;j<size;j++){
        key = list[j];
        i=j-1;
        while(i>=0 && list[i]<key){
            list[i+1] = list[i];
            i--;
        }
        list[i+1] = key;
    }
}

int main()
{
    //int list[] = {5,2,4,6,1,3};
    int list[] = {31,41,59,26,41,58};
    in_sort(list,6);
   
    for(int i=0;i<6;++i){
        cout<<list[i]<<' ';
    }
    cout<<endl;
   
    return 0;
}