QSORT(3) UNIX Programmer's Manual QSORT(3) NNAAMMEE qsort - quicker sort SSYYNNOOPPSSIISS qqssoorrtt((bbaassee,, nneell,, wwiiddtthh,, ccoommppaarr)) cchhaarr **bbaassee;; iinntt ((**ccoommppaarr))(());; DDEESSCCRRIIPPTTIIOONN _Q_s_o_r_t 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 less than, equal to, or greater than the second. SSEEEE AALLSSOO sort(1) BBUUGGSS The comparison routine may not itself call _q_s_o_r_t. Printed 7/9/88 April 10, 1987 1