c++快排random
时间: 2023-11-18 08:52:54 浏览: 99
C语言的快排
好的,针对你的问题,我可以给出以下的C++代码实现快速排序(使用随机化选择pivot):
```c++
#include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;
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;
}
int randomPartition(int arr[], int low, int high) {
srand(time(NULL));
int random = low + rand() % (high - low);
swap(arr[random], arr[high]);
return partition(arr, low, high);
}
void quickSort(int arr[], int low, int high) {
if (low < high) {
int pi = randomPartition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
int main() {
int arr[] = {10, 7, 8, 9, 1, 5};
int n = sizeof(arr) / sizeof(arr[0]);
quickSort(arr, 0, n - 1);
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
return 0;
}
```
阅读全文