给出一个待排席序列(11,20,35,21,19,55,60),采用快速排序算法升序排列该序列。写出排序的每一趟。C++
时间: 2024-06-13 21:08:36 浏览: 132
以下是C++实现的快速排序算法,以升序排列序列(11,20,35,21,19,55,60)为例:
```c++
#include <iostream>
using namespace std;
void quickSort(int arr[], int left, int right) {
int i = left, j = right;
int tmp;
int pivot = arr[(left + right) / 2];
// partition
while (i <= j) {
while (arr[i] < pivot)
i++;
while (arr[j] > pivot)
j--;
if (i <= j) {
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
i++;
j--;
}
};
// recursion
if (left < j)
quickSort(arr, left, j);
if (i < right)
quickSort(arr, i, right);
}
int main() {
int arr[] = {11, 20, 35, 21, 19, 55, 60};
int n = sizeof(arr) / sizeof(arr[0]);
cout << "Original array: ";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
quickSort(arr, 0, n - 1);
cout << "Sorted array: ";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
return 0;
}
```
排序的每一趟如下所示:
第1趟:pivot=21,序列变为(11, 20, 19, 21, 35, 55, 60)
第2趟:pivot=20,序列变为(11, 19, 20, 21, 35, 55, 60)
第3趟:pivot=55,序列变为(11, 19, 20, 21, 35, 55, 60)
排序完成后,序列变为(11, 19, 20, 21, 35, 55, 60)。