用C++写两种快速排序
时间: 2023-11-04 16:38:12 浏览: 35
1. Hoare快速排序:
#include<stdio.h>
void quicksort(int a[], int left, int right);
int main() {
int a[] = {10, 7, 8, 9, 1, 5};
int n = sizeof(a) / sizeof(a[0]);
quicksort(a, 0, n - 1);
for (int i = 0; i < n; i++)
printf("%d ", a[i]);
printf("\n");
return 0;
}
void quicksort(int a[], int left, int right) {
int i = left, j = right;
int pivot = a[(left + right) / 2];
while (i <= j) {
while (a[i] < pivot)
i++;
while (a[j] > pivot)
j--;
if (i <= j) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
i++;
j--;
}
}
if (left < j)
quicksort(a, left, j);
if (i < right)
quicksort(a, i, right);
}
2. Lomuto快速排序:
#include<stdio.h>
void quicksort(int a[], int left, int right);
int main() {
int a[] = {10, 7, 8, 9, 1, 5};
int n = sizeof(a) / sizeof(a[0]);
quicksort(a, 0, n - 1);
for (int i = 0; i < n; i++)
printf("%d ", a[i]);
printf("\n");
return 0;
}
void quicksort(int a[], int left, int right) {
if (left >= right)
return;
int pivot = a[right];
int i = left - 1;
for (int j = left; j <= right - 1; j++) {
if (a[j] < pivot) {
i++;
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
int temp = a[i + 1];
a[i + 1] = a[right];
a[right] = temp;
quicksort(a, left, i);
quicksort(a, i + 2, right);
}