2021-09-17
1.快速排序
using namespace std;
#include<iostream>
#include<math.h>
const int N = 100010;
int n;
int a[N];
void quick_sort(int a[], int left, int right)
{
if (left >= right)
{
return;
}
int x = a[left + right>>1], i = left-1, j = ri
原创
2021-09-17 21:17:23 ·
55 阅读 ·
0 评论