-is an implementation of the quicker-sort algorithm.
-The first argument is a pointer to the base of the data;
-the second is the number of elements;
-the third is the width of an element in bytes;
-the last is the name of the comparison routine
-to be called with two arguments which are pointers
-to the elements being compared.
-The routine must return an integer less than, equal to, or greater than 0
-according as the first argument is to be considered
+is an implementation of C.A.R. Hoare's ``quicksort'' algorithm.
+.PP
+The
+.I qsort
+function sorts an array of
+.I nmemb
+objects, the initial member of which is pointed to by
+.IR base .
+The size of each object is specified by
+.IR size .
+.PP
+The contents of the array are sorted in ascending order according to
+a comparison function pointed to by
+.IR compar ,
+which is called with two arguments that point to the objects being
+compared.
+.PP
+The comparison function must return an integer less than, equal to, or
+greater than zero if the first argument is considered to be respectively