好的,下面是C++代码示例,可以实现你的需求:
```cpp
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
// 冒泡排序
void bubbleSort(std::vector<int>& arr, bool ascending) {
int n = arr.size();
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if ((ascending && arr[j] > arr[j + 1]) || (!ascending && arr[j] < arr[j + 1])) {
std::swap(arr[j], arr[j + 1]);
}
}
}
}
// 插入排序
void insertionSort(std::vector<int>& arr, bool ascending) {
int n = arr.size();
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while ((ascending && j >= 0 && arr[j] > key) || (!ascending && j >= 0 && arr[j] < key)) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}
// 选择排序
void selectionSort(std::vector<int>& arr, bool ascending) {
int n = arr.size();
for (int i = 0; i < n - 1; i++) {
int minIndex = i;
for (int j = i + 1; j < n; j++) {
if ((ascending && arr[j] < arr[minIndex]) || (!ascending && arr[j] > arr[minIndex])) {
minIndex = j;
}
}
std::swap(arr[i], arr[minIndex]);
}
}
// 希尔排序
void shellSort(std::vector<int>& arr, bool ascending) {
int n = arr.size();
for (int gap = n / 2; gap > 0; gap /= 2) {
for (int i = gap; i < n; i++) {
int temp = arr[i];
int j;
for (j = i; j >= gap && ((ascending && arr[j - gap] > temp) || (!ascending && arr[j - gap] < temp)); j -= gap) {
arr[j] = arr[j - gap];
}
arr[j] = temp;
}
}
}
// 归并排序
void merge(std::vector<int>& arr, int left, int mid, int right, bool ascending) {
int n1 = mid - left + 1;
int n2 = right - mid;
std::vector<int> leftArr(n1);
std::vector<int> rightArr(n2);
for (int i = 0; i < n1; i++) {
leftArr[i] = arr[left + i];
}
for (int j = 0; j < n2; j++) {
rightArr[j] = arr[mid + 1 + j];
}
int i = 0, j = 0, k = left;
while (i < n1 && j < n2) {
if ((ascending && leftArr[i] <= rightArr[j]) || (!ascending && leftArr[i] >= rightArr[j])) {
arr[k] = leftArr[i];
i++;
} else {
arr[k] = rightArr[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = leftArr[i];
i++;
k++;
}
while (j < n2) {
arr[k] = rightArr[j];
j++;
k++;
}
}
void mergeSort(std::vector<int>& arr, int left, int right, bool ascending) {
if (left < right) {
int mid = left + (right - left) / 2;
mergeSort(arr, left, mid, ascending);
mergeSort(arr, mid + 1, right, ascending);
merge(arr, left, mid, right, ascending);
}
}
// 快速排序
int partition(std::vector<int>& arr, int low, int high, bool ascending) {
int pivot = arr[high];
int i = low - 1;
for (int j = low; j <= high - 1; j++) {
if ((ascending && arr[j] < pivot) || (!ascending && arr[j] > pivot)) {
i++;
std::swap(arr[i], arr[j]);
}
}
std::swap(arr[i + 1], arr[high]);
return i + 1;
}
void quickSort(std::vector<int>& arr, int low, int high, bool ascending) {
if (low < high) {
int pi = partition(arr, low, high, ascending);
quickSort(arr, low, pi - 1, ascending);
quickSort(arr, pi + 1, high, ascending);
}
}
// 堆排序
void heapify(std::vector<int>& arr, int n, int i, bool ascending) {
int largest = i;
int left = 2 * i + 1;
int right = 2 * i + 2;
if (left < n && ((ascending && arr[left] > arr[largest]) || (!ascending && arr[left] < arr[largest]))) {
largest = left;
}
if (right < n && ((ascending && arr[right] > arr[largest]) || (!ascending && arr[right] < arr[largest]))) {
largest = right;
}
if (largest != i) {
std::swap(arr[i], arr[largest]);
heapify(arr, n, largest, ascending);
}
}
void heapSort(std::vector<int>& arr, bool ascending) {
int n = arr.size();
for (int i = n / 2 - 1; i >= 0; i--) {
heapify(arr, n, i, ascending);
}
for (int i = n - 1; i >= 0; i--) {
std::swap(arr[0], arr[i]);
heapify(arr, i, 0, ascending);
}
}
// 基数排序
int getMax(std::vector<int>& arr) {
int max = arr[0];
int n = arr.size();
for (int i = 1; i < n; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
void countSort(std::vector<int>& arr, int exp, bool ascending) {
int n = arr.size();
std::vector<int> output(n);
int count[10] = {0};
for (int i = 0; i < n; i++) {
count[(arr[i] / exp) % 10]++;
}
if (!ascending) {
for (int i = 8; i >= 0; i--) {
count[i] += count[i + 1];
}
} else {
for (int i = 1; i < 10; i++) {
count[i] += count[i - 1];
}
}
for (int i = n - 1; i >= 0; i--) {
output[count[(arr[i] / exp) % 10] - 1] = arr[i];
count[(arr[i] / exp) % 10]--;
}
for (int i = 0; i < n; i++) {
arr[i] = output[i];
}
}
void radixSort(std::vector<int>& arr, bool ascending) {
int max = getMax(arr);
for (int exp = 1; max / exp > 0; exp *= 10) {
countSort(arr, exp, ascending);
}
}
int main() {
std::ifstream inputFile("C:\\Users\\用户名\\Desktop\\data.txt"); // 替换为data.txt文件的路径
if (!inputFile) {
std::cout << "无法打开文件!" << std::endl;
return 1;
}
std::vector<int> numbers;
int num;
while (inputFile >> num) {
numbers.push_back(num);
}
inputFile.close();
// 复制numbers以便每种排序算法使用相同的初始数据
std::vector<int> numbersCopy = numbers;
// 冒泡排序
bubbleSort(numbersCopy, false); // 从大到小
std::ofstream bubbleSortFileDescending("C:\\Users\\用户名\\Desktop\\冒泡排序.txt"); // 替换为冒泡排序结果文件的路径
for (const auto& num : numbersCopy) {
bubbleSortFileDescending << num << " ";
}
bubbleSortFileDescending.close();
numbersCopy = numbers; // 重置numbersCopy
bubbleSort(numbersCopy, true); // 从小到大
std::ofstream bubbleSortFileAscending("C:\\Users\\用户名\\Desktop\\冒泡排序_从小到大.txt"); // 替换为冒泡排序结果文件的路径
for (const auto& num : numbersCopy) {
bubbleSortFileAscending << num << " ";
}
bubbleSortFileAscending.close();
// 插入排序、选择排序、希尔排序、归并排序、快速排序、堆排序和基数排序的代码类似于冒泡排序,只需要替换函数名和文件路径即可
return 0;
}
```
请将代码中的`C:\\Users\\用户名\\Desktop\\data.txt`替换为`data.txt`文件的实际路径,并将每个排序结果的输出路径替换为你想要存储结果的路径。然后,编译并运行该代码,它将按要求进行排序并将结果写入相应的txt文件中。