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

///'#include ///'stdio.h///'//n//n// 冒泡排序//nvoid bubbleSort(int arr[], int n) {//n int i, j;//n for (i = 0; i < n-1; i++) {//n for (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 int i, j, min_idx;//n for (i = 0; i < n-1; i++) {//n min_idx = i;//n for (j = i+1; j < n; j++) {//n if (arr[j] < arr[min_idx]) {//n min_idx = j;//n }//n }//n int temp = arr[i];//n arr[i] = arr[min_idx];//n arr[min_idx] = temp;//n }//n}//n//n// 插入排序//nvoid insertionSort(int arr[], int n) {//n int i, key, j;//n for (i = 1; i < n; i++) {//n key = arr[i];//n j = i - 1;//n//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//n int arr[n];//n printf(/'请输入数字：/');//n for (int i = 0; i < n; i++) {//n scanf(/'%d/', &arr[i]);//n }//n//n printf(/'使用冒泡排序的结果：/');//n bubbleSort(arr, n);//n for (int i = 0; i < n; i++) {//n printf(/'%d /', arr[i]);//n }//n//n printf(/'//n使用选择排序的结果：/');//n selectionSort(arr, n);//n for (int i = 0; i < n; i++) {//n printf(/'%d /', arr[i]);//n }//n//n printf(/'//n使用插入排序的结果：/');//n insertionSort(arr, n);//n for (int i = 0; i < n; i++) {//n printf(/'%d /', arr[i]);//n }//n//n return 0;//n}//n/