C语言实现冒泡排序和直接插入排序 - 代码示例
#include <stdio.h>\n\nvoid bubble_sort(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\nint main() {\n int arr[100];\n int n;\n\n printf("Enter the number of elements: ");\n scanf("%d", &n);\n\n printf("Enter %d integers:\n", n);\n for (int i = 0; i < n; i++) {\n scanf("%d", &arr[i]);\n }\n\n bubble_sort(arr, n);\n\n printf("Sorted array in ascending order:\n");\n for (int i = 0; i < n; i++) {\n printf("%d ", arr[i]);\n }\n\n return 0;\n}\n\n#include <stdio.h>\n\nvoid insertion_sort(int arr[], int n) {\n for (int i = 1; i < n; i++) {\n int key = arr[i];\n int j = i - 1;\n\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n\n arr[j + 1] = key;\n }\n}\n\nint main() {\n int arr[100];\n int n;\n\n printf("Enter the number of elements: ");\n scanf("%d", &n);\n\n printf("Enter %d integers:\n", n);\n for (int i = 0; i < n; i++) {\n scanf("%d", &arr[i]);\n }\n\n insertion_sort(arr, n);\n\n printf("Sorted array in ascending order:\n");\n for (int i = 0; i < n; i++) {\n printf("%d ", arr[i]);\n }\n\n return 0;\n}
原文地址: https://www.cveoy.top/t/topic/oAzT 著作权归作者所有。请勿转载和采集!