QSORT(3) 1990 QSORT(3) NNAAMMEE qsort - quicker sort SSYYNNOOPPSSIISS ##iinncclluuddee <<ssttddlliibb..hh>> vvooiidd qqssoorrtt((vvooiidd **bbaassee,, ssiizzee__tt nnmmeemmbb,, ssiizzee__tt ssiizzee,, iinntt ((**ccoommppaarr))((ccoonnsstt vvooiidd **,, ccoonnsstt vvooiidd **))));; DDEESSCCRRIIPPTTIIOONN _Q_s_o_r_t is an implementation of C.A.R. Hoare's ``quicksort'' algorithm. The _q_s_o_r_t function sorts an array of _n_m_e_m_b objects, the ini- tial member of which is pointed to by _b_a_s_e. The size of each object is specified by _s_i_z_e. The contents of the array are sorted in ascending order according to a comparison function pointed to by _c_o_m_p_a_r, which is called with two arguments that point to the objects being compared. The comparison function must return an integer less than, equal to, or greater than zero if the first argument is con- sidered to be respectively less than, equal to, or greater than the second. If two members compare as equal, their order in the sorted array is undefined. SSEEEE AALLSSOO sort(1) SSTTAANNDDAARRDDSS QQssoorrtt conforms to ANSI X3.159-1989 (``ANSI C''). BBUUGGSS The comparison routine may not itself call _q_s_o_r_t(3). Printed 7/27/90 May 1