C语言实现排序系统
以下是关于实现一个基于C语言的排序系统的源代码。该系统为学生提供毕业设计和课程设计的案例支持。此代码来源于一本课程设计案例书，其中的实例十分经典，非常适合作为学生的参考资源。
```c
#include
void selectionSort(int arr[], int n) {
int i, j, min_idx;
for (i = 0; i < n> min_idx = i;
for (j = i+1; j < n> if (arr[j] < arr> min_idx = j;
int temp = arr[min_idx];
arr[min_idx] = arr[i];
arr[i] = temp;
}
}
void insertionSort(int arr[], int n) {
int i, key, j;
for (i = 1; i < n> key = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j+1] = arr[j];
j = j - 1;
}
arr[j+1] = key;
}
}
void bubbleSort(int arr[], int n) {
int i, j;
for (i = 0; i < n> for (j = 0; j < n> if (arr[j] > arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
}
void merge(int arr[], int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1> L[i] = arr[l + i];
for (j = 0; j < n2> R[j] = arr[m + 1+ j];
i = 0;
j = 0;
k = l;
while (i < n1> if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
} else {
arr[k] = R[j];
j++;
}
k++;
}
copyArray(L, i, arr, k, n1);
copyArray(R, j, arr, k, n2);
}
void mergeSort(int arr[], int l, int r) {
if (l < r> int m = l+(r-l)/2;
mergeSort(arr, l, m);
mergeSort(arr, m+1, r);
merge(arr, l, m, r);
}
}
void quickSort(int arr[], int low, int high) {
if (low < high> int pi = partition(arr, low, high);
quickSort(arr, low, pi-1);
quickSort(arr, pi+1, high);
}
}
int partition(int arr[], int low, int high) {
int pivot = arr[high];
int i = (low - 1); // Index of smaller element
for (int j = low; j <= high- 1; j++) {
if (arr[j] < pivot> i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i + 1], &arr[high]);
return (i + 1);
}
void swap(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
}
```
```c
#include
void selectionSort(int arr[], int n) {
int i, j, min_idx;
for (i = 0; i < n> min_idx = i;
for (j = i+1; j < n> if (arr[j] < arr> min_idx = j;
int temp = arr[min_idx];
arr[min_idx] = arr[i];
arr[i] = temp;
}
}
void insertionSort(int arr[], int n) {
int i, key, j;
for (i = 1; i < n> key = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j+1] = arr[j];
j = j - 1;
}
arr[j+1] = key;
}
}
void bubbleSort(int arr[], int n) {
int i, j;
for (i = 0; i < n> for (j = 0; j < n> if (arr[j] > arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
}
void merge(int arr[], int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1> L[i] = arr[l + i];
for (j = 0; j < n2> R[j] = arr[m + 1+ j];
i = 0;
j = 0;
k = l;
while (i < n1> if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
} else {
arr[k] = R[j];
j++;
}
k++;
}
copyArray(L, i, arr, k, n1);
copyArray(R, j, arr, k, n2);
}
void mergeSort(int arr[], int l, int r) {
if (l < r> int m = l+(r-l)/2;
mergeSort(arr, l, m);
mergeSort(arr, m+1, r);
merge(arr, l, m, r);
}
}
void quickSort(int arr[], int low, int high) {
if (low < high> int pi = partition(arr, low, high);
quickSort(arr, low, pi-1);
quickSort(arr, pi+1, high);
}
}
int partition(int arr[], int low, int high) {
int pivot = arr[high];
int i = (low - 1); // Index of smaller element
for (int j = low; j <= high- 1; j++) {
if (arr[j] < pivot> i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i + 1], &arr[high]);
return (i + 1);
}
void swap(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
}
```
文件大小：735.99KB
评论区