顺序表的增删查改&&各类排序问题

一，静态顺序表增删查改

#define MAX_SIZE 10  
typedef int DataType;  

typedef struct SeqList  
{  
    DataType array[MAX_SIZE];  
    size_t size;  
}SeqList;
void Print(SeqList* seq)  
{  
    assert(seq);  
    for (size_t i = 0; i <(seq->size); i++)  
    {  
        printf("%d ", seq->array[i]);  
    }  
    printf("\n");  
}  

void InitSeqList(SeqList* seq)  
{  
    assert(seq);  

    memset(seq->array, 0, sizeof(DataType)*(MAX_SIZE));  
    seq->size = 0;  
}  
void DestorySeqList(SeqList* seq)  
{  
    assert(seq);  
    seq->size = 0;  
}  
void PushBack(SeqList* seq, DataType x)  
{  
    assert(seq);  
    if (seq->size >= MAX_SIZE)  
    {  
        printf("The SeqLIst is full\n");  
        return;  
    }  
    seq->array[seq->size] = x;  
    seq->size++;  
}  

void PopBack(SeqList* seq)  
{  
    assert(seq);  
    if (seq->size <= 0)  
    {  
        printf("The SeqList is empty\n");  
        return;  
    }  
    seq->size--;  
}  

void PushFront(SeqList* seq, DataType x)  
{  
    assert(seq);  
    if (seq->size >= MAX_SIZE)  
    {  
        printf("The SeqLIst is full\n");  
        return;  
    }  
    int end = seq->size;  
    while (end >= 0)  
    {  
        seq->array[end] = seq->array[end-1];  
        end--;  
    }  
    seq->size++;  
    seq->array[0] = x;  
}  

void PopFront(SeqList* seq)  
{  
    assert(seq);  
    if (seq->size <= 0)  
    {  
        printf("The SeqList is empty\n&#