C语言排序算法实现：冒泡排序、选择排序、插入排序

#include <stdio.h> \n// 冒泡排序\nvoid bubbleSort(int arr[], int n) {\n for (int i = 0; i < n-1; i++) {\n for (int j = 0; j < n-i-1; j++) {\n if (arr[j] > arr[j+1]) {\n int temp = arr[j];\n arr[j] = arr[j+1];\n arr[j+1] = temp;\n }\n }\n }\n}\n\n// 选择排序\nvoid selectionSort(int arr[], int n) {\n for (int i = 0; i < n-1; i++) {\n int minIndex = i;\n for (int j = i+1; j < n; j++) {\n if (arr[j] < arr[minIndex]) {\n minIndex = j;\n }\n }\n int temp = arr[i];\n arr[i] = arr[minIndex];\n arr[minIndex] = temp;\n }\n}\n\n// 插入排序\nvoid insertionSort(int arr[], int n) {\n for (int i = 1; i < n; i++) {\n int key = arr[i];\n int j = i-1;\n while (j >= 0 && arr[j] > key) {\n arr[j+1] = arr[j];\n j--;\n }\n arr[j+1] = key;\n }\n}\n\nint main() {\n int n;\n printf("请输入数字个数：");\n scanf("%d", &n);\n int arr[n];\n printf("请输入数字：");\n for (int i = 0; i < n; i++) {\n scanf("%d", &arr[i]);\n }\n \n // 冒泡排序\n bubbleSort(arr, n);\n printf("冒泡排序后的结果：");\n for (int i = 0; i < n; i++) {\n printf("%d ", arr[i]);\n }\n printf("\n");\n \n // 选择排序\n selectionSort(arr, n);\n printf("选择排序后的结果：");\n for (int i = 0; i < n; i++) {\n printf("%d ", arr[i]);\n }\n printf("\n");\n \n // 插入排序\n insertionSort(arr, n);\n printf("插入排序后的结果：");\n for (int i = 0; i < n; i++) {\n printf("%d ", arr[i]);\n }\n printf("\n");\n \n return 0;\n}