QSORT

Section: C Library Functions (3)
Index Return to Main Contents

BSD mandoc
 

NAME

qsort, heapsort, mergesort - sort functions  

SYNOPSIS

Fd #include <stdlib.h> Ft void Fn qsort void *base size_t nmemb size_t size int (*compar)(const void *, const void *) Ft int Fn heapsort void *base size_t nmemb size_t size int (*compar)(const void *, const void *) Ft int Fn mergesort void *base size_t nmemb size_t size int (*compar)(const void *, const void *)  

DESCRIPTION

The Fn qsort function is a modified partition-exchange sort, or quicksort. The Fn heapsort function is a modified selection sort. The Fn mergesort function is a modified merge sort with exponential search intended for sorting data with pre-existing order.

The Fn qsort and Fn heapsort functions sort an array of Fa nmemb objects, the initial member of which is pointed to by Fa base . The size of each object is specified by Fa size . Fn Mergesort behaves similarly, but requires that Fa size be greater than ``sizeof(void *) / 2''

The contents of the array Fa base are sorted in ascending order according to a comparison function pointed to by Fa compar , which requires two arguments pointing 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 considered to be respectively less than, equal to, or greater than the second.

The functions Fn qsort and Fn heapsort are not stable, that is, if two members compare as equal, their order in the sorted array is undefined. The function Fn mergesort is stable.

The Fn qsort function is an implementation of C.A.R. Hoare's ``quicksort'' algorithm, a variant of partition-exchange sorting; in particular, see D.E. Knuth's Algorithm Q. Fn Qsort takes O N lg N average time. This implementation uses median selection to avoid its O N**2 worst-case behavior.

The Fn heapsort function is an implementation of J.W.J. William's ``heapsort'' algorithm, a variant of selection sorting; in particular, see D.E. Knuth's Algorithm H. Fn Heapsort takes O N lg N worst-case time. Its only advantage over Fn qsort is that it uses almost no additional memory; while Fn qsort does not allocate memory, it is implemented using recursion.

The function Fn mergesort requires additional memory of size Fa nmemb * Fa size bytes; it should be used only when space is not at a premium. Fn Mergesort is optimized for data with pre-existing order; its worst case time is O N lg N; its best case is O N.

Normally, Fn qsort is faster than Fn mergesort is faster than Fn heapsort . Memory availability and pre-existing order in the data can make this untrue.  

RETURN VALUES

The Fn qsort function returns no value.

Upon successful completion, Fn heapsort and Fn mergesort return 0. Otherwise, they return -1 and the global variable errno is set to indicate the error.  

ERRORS

The Fn heapsort function succeeds unless:

Bq Er EINVAL
The Fa size argument is zero, or, the Fa size argument to Fn mergesort is less than ``sizeof(void *) / 2''
Bq Er ENOMEM
Fn Heapsort or Fn mergesort were unable to allocate memory.

 

COMPATIBILITY

Previous versions of Fn qsort did not permit the comparison routine itself to call Fn qsort 3 . This is no longer true.  

SEE ALSO

sort(1), radixsort(3)
Hoare, C.A.R. 1962 "Quicksort" "The Computer Journal" 5:1 pp. 10-15
Williams, J.W.J 1964 "Heapsort" "Communications of the ACM" 7:1 pp. 347-348
Knuth, D.E. 1968 "The Art of Computer Programming" Vol. 3 "Sorting and Searching" pp. 114-123, 145-149
Mcilroy, P.M. "Optimistic Sorting and Information Theoretic Complexity" "Fourth Annual ACM-SIAM Symposium on Discrete Algorithms" January 1992
Bentley, J.L. "Engineering a Sort Function" "bentley@research.att.com" January 1992
 

STANDARDS

The Fn qsort function conforms to St -ansiC .


 

Index

NAME
SYNOPSIS
DESCRIPTION
RETURN VALUES
ERRORS
COMPATIBILITY
SEE ALSO
STANDARDS

This document was created by man2html, using the manual pages.
Time: 21:44:09 GMT, August 05, 2022