qsort(3) [osf1 man page]

qsort(3)						     Library Functions Manual							  qsort(3)

NAME

       qsort - Sorts a table in place

LIBRARY

       Standard C Library (libc.so, libc.a)

SYNOPSIS

       #include <stdlib.h>

       void qsort(
	       void *base,
	       size_t nmemb,
	       size_t size,
	       int (*compar) (const void *, const void *));

STANDARDS

       Interfaces documented on this reference page conform to industry standards as follows:

       qsort():  XPG4, XPG4-UNIX

       Refer to the standards(5) reference page for more information about industry standards and associated tags.

PARAMETERS

       Points  to  the	first entry in the table.  Specifies the number of entries in the table.  Specifies the size in bytes of each table entry.
       Points to the user-specified function to be used to compare pairs of table elements.  The comparison  function  will  be  called  with  two
       parameters  that  point	to the two elements to be compared. The comparison function must return an integer less than, equal to, or greater
       than zero, depending on whether the first element in the comparison is considered less than, equal to, or greater than the second element.

DESCRIPTION

       The qsort() function sorts a table having a specified number of entries. The contents of the table are sorted in ascending order  according
       to a user-specified comparison function (the strcmp() function, for example).

NOTES

       The  comparison	function  need	not compare every byte, so arbitrary data may be contained in the elements in addition to the values being
       compared.

       When two members compare equal, their order in the sorted array is indeterminate.

RELATED INFORMATION

       Functions: bsearch(3), lsearch(3)

       Standards: standards(5) delim off

																	  qsort(3)

qsort(3C)						   Standard C Library Functions 						 qsort(3C)

NAME

       qsort - quick sort

SYNOPSIS

       #include <stdlib.h>

       void qsort(void *base, size_t nel, size_t width, int (*compar)(const void *, const void *));

DESCRIPTION

       The  qsort()  function  is  an implementation of the quick-sort algorithm. It sorts a table of data in place. The contents of the table are
       sorted in ascending order according to the  user-supplied comparison function.

       The base argument points to the element at the base of the table.  The nel argument is the number of elements  in  the  table.	The  width
       argument specifies the size of each element in bytes.  The compar argument is the name of the comparison function, which 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 contents of the table are sorted in ascending order according to the user supplied comparison function.

USAGE

       The qsort() function safely allows concurrent access by	multiple threads to disjoint data, such as overlapping subtrees or tables.

EXAMPLES

       Example 1: Program sorts.

       The following program sorts a simple array:

       #include <stdlib.h>
       #include <stdio.h>

       static int
       intcompare(const void *p1, const void *p2)
       {
	   int i = *((int *)p1);
	   int j = *((int *)p2);

	   if (i > j)
	       return(1);
	   if (i < j)
	       return (-1);
	   return(0);
       }

       int
       main()
       {
	   int i;
	   int a[10] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
	   size_t nelems = sizeof (a) / sizeof (int);

	   qsort((void *)a, nelems, sizeof (int), intcompare);

	   for (i = 0; i < nelems; i++) {
	       (void) printf("%d ", a[i]);
	   }

	   (void) printf("
");
	   return(0);
       }

ATTRIBUTES

       See attributes(5) for descriptions of the following attributes:

       +-----------------------------+-----------------------------+
       |      ATTRIBUTE TYPE	     |	    ATTRIBUTE VALUE	   |
       +-----------------------------+-----------------------------+
       |Interface Stability	     |Standard			   |
       +-----------------------------+-----------------------------+
       |MT-Level		     |MT-Safe			   |
       +-----------------------------+-----------------------------+

SEE ALSO

       sort(1), bsearch(3C), lsearch(3C), string(3C), attributes(5), standards(5)

NOTES

       The  comparison	function  need	not compare every byte, so arbitrary data may be contained in the elements in addition to the values being
       compared.

       The relative order in the output of two items that compare as equal is unpredictable.

SunOS 5.10							    6 Dec 2004								 qsort(3C)