快速排序

#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
int n;
vector<int >a;
void quick_sort(int l,int r)
{
  int i,j;
  if(l<r)
  {
      i=l;
      j=r;
      int mark=a[l];
      while(i<j)
      {
          while(i<j&&a[j]>=mark)
                j--;
          while(i<j&&a[i]<=mark)
                i++;
          if(a[i]>a[j])
            {
                swap(a[i],a[j]);
            }
      }
      swap(a[i],a[l]);//i==j
  }
  quick_sort(l,i-1);
  quick_sort(i+1,r);

}
int main()
{
  int n;
  cin>>n;
  for(int i=0;i<n;i++)
  {
      int mem;
      cin>>mem;
      a.push_back(mem);
  }
  quick_sort(0,n);
  return 0;
}