插入排序
void Insertion_Sort(int *sequence, int n)
{
int i, j, tmp;
for(i = 1; i < n; i++) {
tmp = sequence[i];
for(j = i-1; j >= 0 && sequence[j] > tmp; j--)
sequence[j+1] = sequence[j];
sequence[j+1] = tmp;
}
}
插入排序
void Insertion_Sort(int *sequence, int n)
{
int i, j, tmp;
for(i = 1; i < n; i++) {
tmp = sequence[i];
for(j = i-1; j >= 0 && sequence[j] > tmp; j--)
sequence[j+1] = sequence[j];
sequence[j+1] = tmp;
}
}