直接插入排序

int[] a = { 9, 3, 6, 2, 7, 4, 8, 5, 4,1,10,27,35,49,20,19 };
void DirIinsertSort(int[] b)
{
int temp1;
for(int i =1; i < b.Length;i++)
{
temp1 = b[i];
int k = i;
for (int j =i-1;j >= 0; j--)
{
if(temp1 > b[j])
{
b[j+1] = b[j];
k = j;
}
}
if(k != i)
b[k] = temp1;
}
}

转载于:https://www.cnblogs.com/tianmochou/p/11454446.html