快排报错求解
查看原帖
快排报错求解
826577
RockeyAurora楼主2022/10/18 20:51
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;
void quick_sort(int a[], int l, int r)
{
	using namespace std;
	int i = l - 1;
	int j = r + 1;
	if (l == r) return;
	int x = a[l];
	while (i < j)
	{
		do i++; while (a[i] < x);
		do j--;	while (a[j] > x);
		if (i < j) swap(a[i], a[j]);
	}
	quick_sort(a, l, j);
	quick_sort(a, j + 1, r);
	
}
int main()
{
	int v[100];
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) { cin >>v[i]; }
	quick_sort(v, 0, n-1);
	for (int j = 0; j < n;j++) { cout << v[j] << endl; }
	return 0;
}
2022/10/18 20:51
加载中...