Return to qsort.3 CVS log

Up to [CSRG BSD Unix] / 43BSDReno / share / man / man3f

Annotation of 43BSDReno/share/man/man3f/qsort.3, revision 1.1.1.1

1.1       root        1: .\" Copyright (c) 1983 Regents of the University of California.
                      2: .\" All rights reserved.  The Berkeley software License Agreement
                      3: .\" specifies the terms and conditions for redistribution.
                      4: .\"
                      5: .\"    @(#)qsort.3f    6.1 (Berkeley) 5/15/85
                      6: .\"
                      7: .TH QSORT 3F "May 15, 1985"
                      8: .UC 5
                      9: .SH NAME
                     10: qsort \- quick sort
                     11: .SH SYNOPSIS
                     12: .B subroutine qsort (array, len, isize, compar)
                     13: .br
                     14: .B external compar
                     15: .br
                     16: .B integer*2 compar
                     17: .SH DESCRIPTION
                     18: One dimensional
                     19: .I array
                     20: contains the elements to be sorted.
                     21: .I len
                     22: is the number of elements in the array.
                     23: .I isize
                     24: is the size of an element, typically -
                     25: .sp 1
                     26: .in +5
                     27: 4 for
                     28: .B integer
                     29: and
                     30: .B real
                     31: .br
                     32: 8 for
                     33: .B "double precision"
                     34: or
                     35: .B complex
                     36: .br
                     37: 16 for
                     38: .B "double complex"
                     39: .br
                     40: (length of character object) for
                     41: .B character
                     42: arrays
                     43: .in -5
                     44: .sp 1
                     45: .I Compar
                     46: is the name of a user supplied integer*2 function
                     47: that will determine the sorting order.
                     48: This function will be called with 2 arguments that will be elements of
                     49: .I array.
                     50: The function must return -
                     51: .sp 1
                     52: .in +5
                     53: negative if arg 1 is considered to precede arg 2
                     54: .br
                     55: zero if arg 1 is equivalent to arg 2
                     56: .br
                     57: positive if arg 1 is considered to follow arg 2
                     58: .in -5
                     59: .sp 1
                     60: On return, the elements of
                     61: .I array
                     62: will be sorted.
                     63: .SH FILES
                     64: .ie \nM /usr/ucb/lib/libU77.a
                     65: .el /usr/lib/libU77.a
                     66: .SH "SEE ALSO"
                     67: qsort(3)

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.