算法 ----- 插入排序(INSERTION_SORT)

for (int i = 1; i < INSERTION_SORT.Length; i++)
{
int temp = INSERTION_SORT[i];
while (i>0 && INSERTION_SORT[i - 1] > INSERTION_SORT[i])
{
INSERTION_SORT[i] = INSERTION_SORT[i - 1];
INSERTION_SORT[i - 1] = temp;
i--;

}

}