C/C++插入排序排序

#include <string>									
									
typedef int ElementType;									
typedef struct Squential {									
    ElementType *Data;									
    int Length;									
} Squential;									
									
void EnterElement(Squential &List) {									
    int Len;									
    int x;									
    printf("Please input the Element Length:");									
    scanf("%d", &Len);									
    fflush(stdin);									
    List.Length = Len;									
    List.Data = (ElementType *) malloc(sizeof(ElementType) * List.Length);									
    for (int i = 0; i < List.Length; ++i) {									
        scanf("%d", &x);									
        List.Data[i] = x;									
    }									
}									
									
void PrintList(Squential List) {									
    for (int i = 0; i < List.Length; ++i) {									
        printf("%4d", List.Data[i]);									
    }									
    printf("\n");									
}									
void InsertSorting(Squential List){							
    int j,i;							
							
    for ( i = 1; i < List.Length; ++i) {							
        int Terminal=List.Data[i];							
        for ( j = i-1; j >= 0 && Terminal <= List.Data[j]; --j) {							
            List.Data[j+1]=List.Data[j];							
        }							
        List.Data[j+1]=Terminal;							
    }							
}