short quicksort

quicksort.cpp

void sort(int* v,int l){
  if(l<=1) return;
  int d[l],b=0,e=l;
  memcpy(d,v,l*sizeof(int));
  for(int i=l-1;i>=0;i--)
    if(d[i]<=d[0]) v[b++]=d[i];
    else           v[--e]=d[i];
  sort(v,b-1); sort(v+b,l-e);
}