利用C++代码随机产生500个1~2000之间的整数并输出,完成以下操作: (1)对给定整数进行直接插入排序,显示排序所用时间; (2)对给定整数进行希尔排序,显示排序所用时间; (3)对给定整数进行起泡排序,显示排序所用时间; (4)对给定整数进行快速排序,显示排序所用时间。
时间: 2023-12-16 19:03:10 浏览: 24
下面是一个使用 C++ 实现该功能的示例代码:
```cpp
#include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;
void insertSort(int arr[], int n) {
clock_t start = clock();
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
cout << "Insertion Sort: " << (double)(clock() - start) / CLOCKS_PER_SEC << " seconds" << endl;
}
void shellSort(int arr[], int n) {
clock_t start = clock();
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 && arr[j - gap] > temp; j -= gap) {
arr[j] = arr[j - gap];
}
arr[j] = temp;
}
}
cout << "Shell Sort: " << (double)(clock() - start) / CLOCKS_PER_SEC << " seconds" << endl;
}
void bubbleSort(int arr[], int n) {
clock_t start = clock();
for (int i = 0; i < n - 1; i++) {
bool flag = false;
for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
swap(arr[j], arr[j + 1]);
flag = true;
}
}
if (!flag) break;
}
cout << "Bubble Sort: " << (double)(clock() - start) / CLOCKS_PER_SEC << " seconds" << endl;
}
int partition(int arr[], int low, int high) {
int pivot = arr[high];
int i = low - 1;
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 quickSort(int arr[], int low, int high) {
if (low < high) {
int pivot = partition(arr, low, high);
quickSort(arr, low, pivot - 1);
quickSort(arr, pivot + 1, high);
}
}
void quickSort(int arr[], int n) {
clock_t start = clock();
quickSort(arr, 0, n - 1);
cout << "Quick Sort: " << (double)(clock() - start) / CLOCKS_PER_SEC << " seconds" << endl;
}
int main() {
int arr[500];
srand(time(NULL));
for (int i = 0; i < 500; i++) {
arr[i] = rand() % 2000 + 1;
}
insertSort(arr, 500);
shellSort(arr, 500);
bubbleSort(arr, 500);
quickSort(arr, 500);
return 0;
}
```
该程序首先生成了 500 个 1 ~ 2000 之间的随机整数,并将其存储在一个数组中。接下来,分别调用了直接插入排序、希尔排序、冒泡排序和快速排序对这些随机整数进行排序,并输出了排序所用的时间。