算法调用:
首先,我们在 `sort.c` 文件中实现选择排序、冒泡排序和插入排序的函数。具体代码如下:
#include "sort.h"
// 选择排序
void selectionSort(int arr[], int n) {
int i, j, minIndex, temp;
for (i = 0; i < n - 1; i++) {
minIndex = i;
for (j = i + 1; j < n; j++) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
}
}
temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = 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;
}
}
接下来,我们在 `sort.h` 文件中声明这几个排序函数。具体代码如下:
#ifndef SORT_H
#define SORT_Hvoid selectionSort(int arr[], int n);
void bubbleSort(int arr[], int n);
void insertionSort(int arr[], int n);
#endif
最后,在 `demo.c` 文件中调用这几个排序函数。具体代码如下:
#include <stdio.h>
#include "sort.h"
int main() {
int arr1[] = {5, 2, 8, 1, 9};
int n1 = sizeof(arr1) / sizeof(arr1[0]);
printf("Original array: ");
for (int i = 0; i < n1; i++) {
printf("%d ", arr1[i]);
}
printf("\n");
selectionSort(arr1, n1);
printf("Array after selection sort: ");
for (int i = 0; i < n1; i++) {
printf("%d ", arr1[i]);
}
printf("\n");
int arr2[] = {5, 2, 8, 1, 9};
int n2 = sizeof(arr2) / sizeof(arr2[0]);
printf("Original array: ");
for (int i = 0; i < n2; i++) {
printf("%d ", arr2[i]);
}
printf("\n");
bubbleSort(arr2, n2);
printf("Array after bubble sort: ");
for (int i = 0; i < n2; i++) {
printf("%d ", arr2[i]);
}
printf("\n");
int arr3[] = {5, 2, 8, 1, 9};
int n3 = sizeof(arr3) / sizeof(arr3[0]);
printf("Original array: ");
for (int i = 0; i < n3; i++) {
printf("%d ", arr3[i]);
}
printf("\n");
insertionSort(arr3, n3);
printf("Array after insertion sort: ");
for (int i = 0; i < n3; i++) {
printf("%d ", arr3[i]);
}
printf("\n");
return 0;
}
在 `demo.c` 文件中,我们首先定义了三个数组 `arr1`、`arr2`、`arr3`,并分别调用了选择排序、冒泡排序和插入排序函数对它们进行排序。然后,我们输出排序前和排序后的数组内容。
编译并运行 `demo.c` 文件,即可看到排序结果。