快速排序
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 1000;
int a[N];
void quick_sort(int l, int r, int* a)
{
if(l >= r) return;
int mid = l + r >> 1;
int i = l - 1, j = r + 1;
int x = a[mid];
while(true)
{.
原创
2020-10-20 19:55:35 ·
127 阅读 ·
0 评论