看了别人的思路把代码写出来了
对比了以下,代码都差不多,应该没错吧,新手第一次写
别人的思路:https://blog.csdn.net/MoreWindows/article/details/6684558
#include<iostream>
using namespace std;
int a[10], n;
//快速排序
void quicksort(int left, int right) {
if (left < right) {
int x;//坑
int i = left, j = right;
x = a[left];//第一个坑
while (i < j) {
while (i < j&&a[j] >= x) {//从右往左走
j--;
}
if (i < j) a[i] = a[j];
while (i < j&&a[i] <= x) {
i++;
}
if (i < j) a[j] = a[i];
}
a[i] = x;
quicksort(left, i - 1);
quicksort(i + 1, right);
}
}
int main() {
cout << "输入你要排多少个元素";
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
quicksort(0, n - 1);
for (int i = 0; i < n; i++) {
cout << a[i];
}
return 0;
}