插入排序C语言

#include "stdio.h"
#include "stdlib.h"
typedef int ElemType;
//直接插入排序
void InsertSort(ElemType A[], int n) {
    int i, j;
    for (i =2; i <= n; i++) {
        A[0] = A[i];
        j = i - 1;
        while (A[0] < A[j]) {
            A[j+1] = A[j];
            j = j - 1;
        }
        A[j + 1] = A[0];
    }
}
//折半插入排序
void BinSort(ElemType A[], int n) {
    int i, j, low, high, mid;
    for (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];//A[low]=A[0];
    }
}
//希尔排序
void ShellInsert(ElemType A[], int n,int delta) {
    int i, j;
    for(i=1+delta;i<=n;i++)
        if (A[i] < A[i - delta]) {
            A[0] = A[i];
            for (j = i - delta; j > 0 && A[0] < A[j]; j -= delta)
                A[j + delta] = A[j];
            A[j + delta] = A[0];
        }
}
void ShellSort(ElemType A[], int n, int delta[], int dn) {
    int i, j;
    for (i = 0; i <= n - 1; ++i)
        ShellInsert(A, n, delta[i]);
}
//希尔建议希尔排序
void ShellSort(ElemType A[], int n) {
    int dk,i,j;
    for(dk=n/2;dk>=1;dk=dk/2)
        for (i = dk + 1; i <= n; ++i) {
            if (A[i] < A[i - dk]) {
                A[0] = A[i];
                for (j = i - dk; j > 0 && A[0] < A[j]; j -= dk)
                    A[j + dk] = A[j];
                A[j + dk] = A[0];
            }
        }
}