void main() { int a[10]={18,26,31,72,8,15,88,72,35,20}; int i; heapSort(a,10); 帮我续写这段程序

}void heapSort(int a[], int len) {
buildMaxHeap(a, len);
for (int i = len - 1; i > 0; i--) {
swap(a[i], a[0]);
len--;
maxHeapify(a, 0, len);
}
}

void buildMaxHeap(int a[], int len) {
for (int i = len/2 - 1; i >= 0; i--) {
maxHeapify(a, i, len);
}
}

void maxHeapify(int a[], int i, int len) {
int l = 2*i + 1;
int r = 2*i + 2;
int largest = i;
if (l < len && a[l] > a[largest]) {
largest = l;
}
if (r < len && a[r] > a[largest]) {
largest = r;
}
if (largest != i) {
swap(a[i], a[largest]);
maxHeapify(a, largest, len);
}
}

相关问题

用归并排序算法完成对数组a中的10个元素从小到大排序。void main() {int a[10]={18,26,31,72,8,15,88,72,35,20}; }

你好，这是一个归并排序算法实现数组排序的示例代码：

#include <stdio.h>

void merge(int arr[], int left, int mid, int right) {
    int i, j, k;
    int n1 = mid - left + 1;
    int n2 = right - mid;
    int L[n1], R[n2];
    
    for (i = 0; i < n1; i++)
        L[i] = arr[left + i];
    for (j = 0; j < n2; j++)
        R[j] = arr[mid + 1 + j];
    
    i = 0;
    j = 0;
    k = left;
    while (i < n1 && j < n2) {
        if (L[i] <= R[j]) {
            arr[k] = L[i];
            i++;
        }
        else {
            arr[k] = R[j];
            j++;
        }
        k++;
    }
    
    while (i < n1) {
        arr[k] = L[i];
        i++;
        k++;
    }
    
    while (j < n2) {
        arr[k] = R[j];
        j++;
        k++;
    }
}

void mergeSort(int arr[], int left, int right) {
    if (left < right) {
        int mid = left + (right - left) / 2;

        mergeSort(arr, left, mid);
        mergeSort(arr, mid + 1, right);

        merge(arr, left, mid, right);
    }
}

int main() {
    int arr[10] = {18, 26, 31, 72, 8, 15, 88, 72, 35, 20};
    int n = 10, i;
    
    printf("Original array: ");
    for (i = 0; i < n; i++)
        printf("%d ", arr[i]);
    printf("\n");
  
    mergeSort(arr, 0, n - 1);
  
    printf("Sorted array: ");
    for (i = 0; i < n; i++)
        printf("%d ", arr[i]);
    printf("\n");
    
    return 0;
}

希望这能帮助您解决问题。

编程题：用归并排序算法完成对数组a中的10个元素从小到大排序。 void main() {int a[10]={18,26,31,72,8,15,88,72,35,20}; }

这道编程题可以用归并排序算法完成对数组a中的10个元素从小到大排序。在归并排序算法中，先把数组递归地划分为更小的子数组，然后再将子数组归并为更大的有序数组，直到最终形成一个完整的有序数组。具体地，可以编写一个merge_sort函数，将传入的数组进行排序。下面是示例代码：

void merge_sort(int a[], int left, int right) {
if (left < right) {
int middle = (left + right) / 2;
merge_sort(a, left, middle);
merge_sort(a, middle + 1, right);
merge(a, left, middle, right);
}
}

void merge(int a[], int left, int middle, int right) {
int i = left, j = middle + 1, k = 0;
int temp[right - left + 1];
while (i <= middle && j <= right) {
if (a[i] < a[j]) {
temp[k++] = a[i++];
} else {
temp[k++] = a[j++];
}
}
while (i <= middle) {
temp[k++] = a[i++];
}
while (j <= right) {
temp[k++] = a[j++];
}
for (i = left, k = 0; i <= right; i++, k++) {
a[i] = temp[k];
}
}

int main() {
int a[10] = {18,26,31,72,8,15,88,72,35,20};
merge_sort(a, 0, 9);
for (int i = 0; i < 10; i++) {
printf("%d ", a[i]);
}
return 0;
}

希望对您有帮助！