#ifndef _QSORT_C_
#define _QSORT_C_

/* my realisation of hoare's qsort algorithm */

void _sort(void *a[], int l, int r, int (*compar)(const void *, const void *))
{
int i, j; void *x, *y;

i=l; j=r; x=a[(l+r)/2];
do
 {
 while (compar(a[i], x)<0) i++;
 while (compar(x, a[j])<0) j--;
 if (i<=j)
  {
  y=a[i]; a[i]=a[j]; a[j]=y;
  i++; j--;
  }
 }
while (i<j);

if (l<j) _sort(a, l, j, compar);
if (i<r) _sort(a, i, r, compar);

}

void mysort(void *base[], int num, int (*compar)(const void *, const void *))
{
_sort(base, 0, num-1, compar);
}

#endif