插入排序
//直接插入排序
void InsertSort(int A[], int n) {
int i, j;
for (i = 2;i <= n;i++) {
if (A[i] < A[i - 1])
{
A[0] = A[i];//复制为哨兵,不存元素
for (j = i - 1;A[0] < A[j];--j)
A[j + 1] = A[j];
A[j + 1] = A[0];
}
}
}
//折半插入排序
void InsertSort(int A[], int n) {
int i, j, low, high, mid;
for (int i = 2;i <= n;i++) {
A[0] = A[i];
low = 1;high = i - 1;
while (low <= high) {
mid = (low + high) / 2;
if (A[mid] > A[0])
high = mid + 1;
else
low = mid + 1;
}
for (j = i - 1;j >= high + 1;--j) {
A[j + 1] = A[j];//统一后移,空出位置
A[high + 1] = A[0];
}
}
}
//希尔排序
void ShellSort(int A[], int n) {
int d, i, j;
for ( d = n / 2;d >= 1;d = d / 2) {
for (i = d + 1;i <= n;++i) {
if (A[i] < A[i - d]){
A[0] = A[i];
for (j = i - d;j > 0 && A[0] < A[j];j -= d)//记录后移,查找插入的位置
A[j + d] = A[j];
A[j + d] = A[0];
}
}
}