分别用堆排序及快速排序算法，对待排序记录进行排序并输出排序结果。c语言实现

好的，以下是 C 语言代码实现：

堆排序：

#include <stdio.h>

void heap_sort(int arr[], int n);
void heapify(int arr[], int n, int i);

int main()
{
    int arr[] = {12, 11, 13, 5, 6, 7};
    int n = sizeof(arr) / sizeof(arr[0]);

    printf("原数组：");
    for (int i = 0; i < n; ++i) {
        printf("%d ", arr[i]);
    }

    heap_sort(arr, n);

    printf("\n堆排序后：");
    for (int i = 0; i < n; ++i) {
        printf("%d ", arr[i]);
    }

    return 0;
}

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

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

快速排序：

#include <stdio.h>

void quick_sort(int arr[], int low, int high);
int partition(int arr[], int low, int high);

int main()
{
    int arr[] = {12, 11, 13, 5, 6, 7};
    int n = sizeof(arr) / sizeof(arr[0]);

    printf("原数组：");
    for (int i = 0; i < n; ++i) {
        printf("%d ", arr[i]);
    }

    quick_sort(arr, 0, n - 1);

    printf("\n快速排序后：");
    for (int i = 0; i < n; ++i) {
        printf("%d ", arr[i]);
    }

    return 0;
}

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

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

以上代码仅供参考，实际使用时建议先进行测试和优化。