c语言编程实现直接插入排序、希尔排序、冒泡排序、快速排序、选择排序和堆排序。要求：设计菜单界面、每个排序算法通过选菜单实现，同时要求界面有退出菜单。

以下是一个可能的实现，包括菜单界面和每个排序算法的代码。

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

// 直接插入排序
void insertionSort(int arr[], int n) {
    int i, key, j;
    for (i = 1; i < n; i++) {
        key = arr[i];
        j = i - 1;

        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        arr[j + 1] = key;
    }
}

// 希尔排序
void shellSort(int arr[], int n) {
    int i, j, gap, temp;
    for (gap = n / 2; gap > 0; gap /= 2) {
        for (i = gap; i < n; i++) {
            temp = arr[i];
            for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
                arr[j] = arr[j - gap];
            arr[j] = temp;
        }
    }
}

// 冒泡排序
void bubbleSort(int arr[], int n) {
    int i, j, temp;
    for (i = 0; i < n - 1; i++) {
        for (j = 0; j < n - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}

// 快速排序
int partition(int arr[], int low, int high) {
    int pivot = arr[high];
    int i = (low - 1);
    int j, temp;
    for (j = low; j <= high - 1; j++) {
        if (arr[j] < pivot) {
            i++;
            temp = arr[i];
            arr[i] = arr[j];
            arr[j] = temp;
        }
    }
    temp = arr[i + 1];
    arr[i + 1] = arr[high];
    arr[high] = temp;
    return (i + 1);
}

void quickSort(int arr[], int low, int high) {
    if (low < high) {
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

// 选择排序
void selectionSort(int arr[], int n) {
    int i, j, min_idx, temp;
    for (i = 0; i < n - 1; i++) {
        min_idx = i;
        for (j = i + 1; j < n; j++)
            if (arr[j] < arr[min_idx])
                min_idx = j;
        temp = arr[min_idx];
        arr[min_idx] = arr[i];
        arr[i] = temp;
    }
}

// 堆排序
void heapify(int arr[], int n, int i) {
    int largest = i;
    int l = 2 * i + 1;
    int r = 2 * i + 2;
    int temp;
    if (l < n && arr[l] > arr[largest])
        largest = l;
    if (r < n && arr[r] > arr[largest])
        largest = r;
    if (largest != i) {
        temp = arr[i];
        arr[i] = arr[largest];
        arr[largest] = temp;
        heapify(arr, n, largest);
    }
}

void heapSort(int arr[], int n) {
    int i, temp;
    for (i = n / 2 - 1; i >= 0; i--)
        heapify(arr, n, i);
    for (i = n - 1; i >= 0; i--) {
        temp = arr[0];
        arr[0] = arr[i];
        arr[i] = temp;
        heapify(arr, i, 0);
    }
}

int main() {
    int choice, n, i;
    int *arr = NULL;

    do {
        printf("\nSort Menu:\n");
        printf("1. Insertion Sort\n");
        printf("2. Shell Sort\n");
        printf("3. Bubble Sort\n");
        printf("4. Quick Sort\n");
        printf("5. Selection Sort\n");
        printf("6. Heap Sort\n");
        printf("0. Quit\n");

        printf("\nEnter your choice: ");
        scanf("%d", &choice);

        if (choice != 0) {
            printf("\nEnter the number of elements: ");
            scanf("%d", &n);

            arr = (int*)malloc(n * sizeof(int));
            printf("\nEnter %d elements: ", n);
            for (i = 0; i < n; i++)
                scanf("%d", &arr[i]);
        }

        switch (choice) {
            case 1:
                insertionSort(arr, n);
                printf("\nInsertion Sort Result: ");
                for (i = 0; i < n; i++)
                    printf("%d ", arr[i]);
                break;
            case 2:
                shellSort(arr, n);
                printf("\nShell Sort Result: ");
                for (i = 0; i < n; i++)
                    printf("%d ", arr[i]);
                break;
            case 3:
                bubbleSort(arr, n);
                printf("\nBubble Sort Result: ");
                for (i = 0; i < n; i++)
                    printf("%d ", arr[i]);
                break;
            case 4:
                quickSort(arr, 0, n - 1);
                printf("\nQuick Sort Result: ");
                for (i = 0; i < n; i++)
                    printf("%d ", arr[i]);
                break;
            case 5:
                selectionSort(arr, n);
                printf("\nSelection Sort Result: ");
                for (i = 0; i < n; i++)
                    printf("%d ", arr[i]);
                break;
            case 6:
                heapSort(arr, n);
                printf("\nHeap Sort Result: ");
                for (i = 0; i < n; i++)
                    printf("%d ", arr[i]);
                break;
            default:
                printf("\nInvalid choice.");
                break;
        }

        free(arr);

    } while (choice != 0);

    return 0;
}

这个程序运行后会显示一个菜单，让用户选择排序算法。然后，它会要求用户输入要排序的元素数量和元素本身，并在对应的排序算法上调用它们。最后，它会输出排序结果。

注意，由于这个程序动态分配了内存，所以在程序结束之前要释放所有内存。