void insert_sort(int arry[], int n)
{
int curPosition;
int inserPosition;
int searPosition;
int insertNum;
for(curPosition = 1; curPosition < n; curPosition++)
{
insertNum = arry[curPosition];
for(searPosition = curPosition; searPosition > 0; searPosition--)
{
if(insertNum < arry[searPosition-1])
{
arry[searPosition] = arry[searPosition-1];
}
else
{
break;
}
}
inserPosition = searPosition;
arry[inserPosition] = insertNum;
}
}
{
int curPosition;
int inserPosition;
int searPosition;
int insertNum;
for(curPosition = 1; curPosition < n; curPosition++)
{
insertNum = arry[curPosition];
for(searPosition = curPosition; searPosition > 0; searPosition--)
{
if(insertNum < arry[searPosition-1])
{
arry[searPosition] = arry[searPosition-1];
}
else
{
break;
}
}
inserPosition = searPosition;
arry[inserPosition] = insertNum;
}
}