用C语言利用直接插入算法实现将待排序序列{3,6,2,10,1,20,88,8,5,7,4,9}由小到大排序，并输出结果。

好的，以下是用C语言实现直接插入排序的代码：

#include <stdio.h>

void insertion_sort(int arr[], int n) {
    int i, j, key;
    for (i = 1; i < n; i++) {
        key = arr[i];
        j = i - 1;
        while (j >= 0 && arr[j] > key) {
            arr[j+1] = arr[j];
            j--;
        }
        arr[j+1] = key;
    }
}

int main() {
    int arr[] = {3,6,2,10,1,20,88,8,5,7,4,9};
    int n = sizeof(arr) / sizeof(arr[0]);
    insertion_sort(arr, n);
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}

输出结果为：1 2 3 4 5 6 7 8 9 10 20 88。

相关问题

几种典型排序算法的实现 C语言编程实现:分别利用直接插入排序算法实现将待排序序列{3,6,2,10,1,20,88,8,5,7,4,9}由小到大排序,并输出结果。

好的，下面是直接插入排序算法的C语言代码实现：

#include <stdio.h>

void InsertionSort(int arr[], int n) {
    int i, j, temp;
    for (i = 1; i < n; i++) {
        temp = arr[i];
        for (j = i - 1; j >= 0 && arr[j] > temp; j--) {
            arr[j + 1] = arr[j];
        }
        arr[j + 1] = temp;
    }
}

int main() {
    int arr[] = {3, 6, 2, 10, 1, 20, 88, 8, 5, 7, 4, 9};
    int n = sizeof(arr) / sizeof(arr[0]);

    printf("Before sorting: ");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }

    InsertionSort(arr, n);

    printf("\nAfter sorting: ");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}

输出结果为：

Before sorting: 3 6 2 10 1 20 88 8 5 7 4 9 
After sorting: 1 2 3 4 5 6 7 8 9 10 20 88

其中 `InsertionSort` 函数是直接插入排序算法的实现，它的时间复杂度为 $O(n^2)$，空间复杂度为 $O(1)$。

用c语言编程实现：分别利用直接插入/折半插入/希尔/冒泡/快速/简单选择排序算法实现将待排序序列{3,6,2,10,1,20,88,8,5,7,4,9}由小到大排序，并输出结果

好的，以下是使用不同排序算法对序列进行排序的C语言代码：

直接插入排序：

#include <stdio.h>

void insert_sort(int arr[], int len) {
    int i, j, k;
    for (i = 1; i < len; i++) {
        k = arr[i];
        for (j = i - 1; j >= 0 && arr[j] > k; j--) {
            arr[j + 1] = arr[j];
        }
        arr[j + 1] = k;
    }
}

int main() {
    int arr[] = {3,6,2,10,1,20,88,8,5,7,4,9};
    int len = sizeof(arr) / sizeof(arr[0]);
    insert_sort(arr, len);
    for (int i = 0; i < len; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

折半插入排序：

#include <stdio.h>

void binary_insert_sort(int arr[], int len) {
    int i, j, low, high, mid, k;
    for (i = 1; i < len; i++) {
        k = arr[i];
        low = 0;
        high = i - 1;
        while (low <= high) {
            mid = (low + high) / 2;
            if (arr[mid] > k) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }
        for (j = i - 1; j >= high + 1; j--) {
            arr[j + 1] = arr[j];
        }
        arr[high + 1] = k;
    }
}

int main() {
    int arr[] = {3,6,2,10,1,20,88,8,5,7,4,9};
    int len = sizeof(arr) / sizeof(arr[0]);
    binary_insert_sort(arr, len);
    for (int i = 0; i < len; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

希尔排序：

#include <stdio.h>

void shell_sort(int arr[], int len) {
    int i, j, gap;
    int temp;
    for (gap = len >> 1; gap > 0; gap >>= 1) {
        for (i = gap; i < len; i++) {
            temp = arr[i];
            for (j = i - gap; j >= 0 && arr[j] > temp; j -= gap) {
                arr[j + gap] = arr[j];
            }
            arr[j + gap] = temp;
        }
    }
}

int main() {
    int arr[] = {3,6,2,10,1,20,88,8,5,7,4,9};
    int len = sizeof(arr) / sizeof(arr[0]);
    shell_sort(arr, len);
    for (int i = 0; i < len; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

冒泡排序：

#include <stdio.h>

void bubble_sort(int arr[], int len) {
    int i, j, temp;
    for (i = 0; i < len - 1; i++) {
        for (j = 0; j < len - 1 - i; j++) {
            if (arr[j] > arr[j + 1]) {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}

int main() {
    int arr[] = {3,6,2,10,1,20,88,8,5,7,4,9};
    int len = sizeof(arr) / sizeof(arr[0]);
    bubble_sort(arr, len);
    for (int i = 0; i < len; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

快速排序：

#include <stdio.h>

void quick_sort(int arr[], int left, int right) {
    if (left >= right) {
        return;
    }
    int i = left;
    int j = right;
    int pivot = arr[left];
    while (i < j) {
        while (i < j && arr[j] >= pivot) {
            j--;
        }
        arr[i] = arr[j];
        while (i < j && arr[i] <= pivot) {
            i++;
        }
        arr[j] = arr[i];
    }
    arr[i] = pivot;
    quick_sort(arr, left, i - 1);
    quick_sort(arr, i + 1, right);
}

int main() {
    int arr[] = {3,6,2,10,1,20,88,8,5,7,4,9};
    int len = sizeof(arr) / sizeof(arr[0]);
    quick_sort(arr, 0, len - 1);
    for (int i = 0; i < len; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

简单选择排序：

#include <stdio.h>

void select_sort(int arr[], int len) {
    int i, j, min, temp;
    for (i = 0; i < len - 1; i++) {
        min = i;
        for (j = i + 1; j < len; j++) {
            if (arr[j] < arr[min]) {
                min = j;
            }
        }
        if (min != i) {
            temp = arr[i];
            arr[i] = arr[min];
            arr[min] = temp;
        }
    }
}

int main() {
    int arr[] = {3,6,2,10,1,20,88,8,5,7,4,9};
    int len = sizeof(arr) / sizeof(arr[0]);
    select_sort(arr, len);
    for (int i = 0; i < len; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

以上就是使用不同排序算法对序列进行排序的C语言代码。