NAME | SYNOPSIS | API RESTRICTIONS | DESCRIPTION | NOTES | ATTRIBUTES | SEE ALSO
$(NUCLEUS_DIR)/lib/classix/libsys.s.a #include <stdlib.h>void qsort(void *base, size_t nel, size_t width, int (*compar)const void *, const void *);
The function or functions documented here may not be used safely in all application contexts with all APIs provided in the ChorusOS 5.0 product.
See API(5FEA) for details.
The qsort() function is an implementation of the quicker-sort algorithm; it sorts a table of data. The contents of the table are sorted in ascending order according to a user-supplied comparison function.
The base pointer indicates the element at the base of the table. nel is the number of elements in the table, and width specifies the size of each element in bytes. The name of the comparison function, compar, is called with two arguments that point to the elements being compared. The function must return an integer less than, equal to, or greater than zero to indicate if the first argument is to be considered less than, equal to, or greater than the second argument.
The comparison function need not compare every byte. Arbitrary data may be contained in the elements in addition to the values being compared. If two items compare as equal, the order of output is unpredictable.
See attributes(5) for descriptions of the following attributes:
ATTRIBUTE TYPE | ATTRIBUTE VALUE |
---|---|
Interface Stability | Evolving |
NAME | SYNOPSIS | API RESTRICTIONS | DESCRIPTION | NOTES | ATTRIBUTES | SEE ALSO