C语言实现正整数数组降序排序 - 选择、冒泡、插入排序算法示例

#include <stdio.h>

void selectionSort(int arr[], int n) { int i, j, maxIndex, temp; for (i = 0; i < n-1; i++) { maxIndex = i; for (j = i+1; j < n; j++) { if (arr[j] > arr[maxIndex]) { maxIndex = j; } } temp = arr[i]; arr[i] = arr[maxIndex]; arr[maxIndex] = 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; } } } }

void insertionSort(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 = j-1; } arr[j+1] = key; } }

int main() { int n, i; scanf('%d', &n); int arr[n]; for (i = 0; i < n; i++) { scanf('%d', &arr[i]); }

// 选择排序
selectionSort(arr, n);

// 冒泡排序
// bubbleSort(arr, n);

// 插入排序
// insertionSort(arr, n);

for (i = 0; i < n; i++) {
    printf('%4d', arr[i]);
}

return 0;

}