sort an array NAME qsort, qsort_r - sort an array LIBRARY Standard C library ( libc , -lc ) SY...sort an array NAME qsort, qsort_r - sort an array LIBRARY Standard C library ( libc , -lc ) SY...binary search of a sorted array NAME bsearch - binary search of a sorted array LIBRARY Standard C library ( libc......ap_type what , ] stat api only enum item * items , int numitems ); struct stack ** procps_sort ( struct info * info , struct stack * stacks [], int numstacked , enum item sortit…...* these , int numthese , enum pids_select_type which ); struct pids_stack ** procps_pids_sort ( struct pids_info * info , struct pids_stack * stacks [], int numstacked , enum pi…...at it can. GLOB_MARK Append a slash to each path which corresponds to a directory. GLOB_NOSORT Don't sort the returned pathnames. The only reason to do this is to save processin…...at it can. GLOB_MARK Append a slash to each path which corresponds to a directory. GLOB_NOSORT Don't sort the returned pathnames. The only reason to do this is to save processin…scan a directory for matching entries NAME scandir, scandirat, alphasort, versionsort - scan a directory for matching entries LIBRARY Standard C library ( libc ,...scan a directory for matching entries NAME scandir, scandirat, alphasort, versionsort - scan a directory for matching entries LIBRARY Standard C library ( libc ,...scan a directory for matching entries NAME scandir, scandirat, alphasort, versionsort - scan a directory for matching entries LIBRARY Standard C library ( libc ,...scan a directory for matching entries NAME scandir, scandirat, alphasort, versionsort - scan a directory for matching entries LIBRARY Standard C library ( libc ,......manual page describes only the btree-specific information. The btree data structure is a sorted, balanced tree structure storing associated key/data pairs. The btree access-meth…...eaddir () depends on the filesystem implementation; it is unlikely that the names will be sorted in any fashion. SEE ALSO getdents (2), read (2), closedir (3), dirfd (3), ftw (3…...e application should try using the addresses in the order in which they are returned. The sorting function used within getaddrinfo () is defined in RFC 3484; the order can be tw…...e application should try using the addresses in the order in which they are returned. The sorting function used within getaddrinfo () is defined in RFC 3484; the order can be tw…...e application should try using the addresses in the order in which they are returned. The sorting function used within getaddrinfo () is defined in RFC 3484; the order can be tw…...mats are btree, hashed, and UNIX file oriented. The btree format is a representation of a sorted, balanced tree structure. The hashed format is an extensible, dynamic hashing sc…...mats are btree, hashed, and UNIX file oriented. The btree format is a representation of a sorted, balanced tree structure. The hashed format is an extensible, dynamic hashing sc…