针对顺序表的存储结构及各个相关算法,设计一个验证程序,完成顺序表的建立、插入、删除、查找、遍历、排序、归并等算法的设计和编程调试

以下是一个基于C语言的顺序表验证程序的示例代码：

#include <stdio.h>
#include <stdlib.h>

#define MAXSIZE 100

typedef struct {
    int data[MAXSIZE];
    int length;
} SeqList;

void init_list(SeqList *L)
{
    L->length = 0;
}

void insert(SeqList *L, int pos, int elem)
{
    if (pos < 0 || pos > L->length || L->length == MAXSIZE) {
        printf("Insert failed: Invalid position or list is full.\n");
        return;
    }

    for (int i = L->length - 1; i >= pos; i--) {
        L->data[i+1] = L->data[i];
    }
    L->data[pos] = elem;
    L->length++;
}

void delete(SeqList *L, int pos)
{
    if (pos < 0 || pos >= L->length) {
        printf("Delete failed: Invalid position.\n");
        return;
    }

    for (int i = pos; i < L->length - 1; i++) {
        L->data[i] = L->data[i+1];
    }
    L->length--;
}

int search(SeqList *L, int elem)
{
    for (int i = 0; i < L->length; i++) {
        if (L->data[i] == elem) {
            return i;
        }
    }
    return -1;
}

void traverse(SeqList *L)
{
    printf("List: ");
    for (int i = 0; i < L->length; i++) {
        printf("%d ", L->data[i]);
    }
    printf("\n");
}

void merge(SeqList *L1, SeqList *L2, SeqList *L3)
{
    int i = 0, j = 0, k = 0;
    while (i < L1->length && j < L2->length) {
        if (L1->data[i] < L2->data[j]) {
            L3->data[k++] = L1->data[i++];
        } else {
            L3->data[k++] = L2->data[j++];
        }
    }
    while (i < L1->length) {
        L3->data[k++] = L1->data[i++];
    }
    while (j < L2->length) {
        L3->data[k++] = L2->data[j++];
    }
    L3->length = k;
}

void sort(SeqList *L)
{
    for (int i = 0; i < L->length - 1; i++) {
        for (int j = i + 1; j < L->length; j++) {
            if (L->data[i] > L->data[j]) {
                int temp = L->data[i];
                L->data[i] = L->data[j];
                L->data[j] = temp;
            }
        }
    }
}

int main()
{
    SeqList L;
    init_list(&L);
    insert(&L, 0, 1);
    insert(&L, 1, 3);
    insert(&L, 2, 5);
    traverse(&L);
    delete(&L, 1);
    traverse(&L);
    int pos = search(&L, 5);
    printf("Position of 5: %d\n", pos);
    SeqList L1 = {{1, 3, 5}, 3};
    SeqList L2 = {{2, 4, 6}, 3};
    SeqList L3;
    merge(&L1, &L2, &L3);
    traverse(&L3);
    sort(&L);
    traverse(&L);
    return 0;
}

该程序实现了顺序表的建立、插入、删除、查找、遍历、排序、归并等算法。在实际使用时，可以根据需要进行修改和扩展。