1.  ssssoooorrrrtttt____aaaarrrrrrrraaaayyyy((((3333))))          MMMMuuuuddddOOOOSSSS ((((5555 SSSSeeeepppp 1111999999994444))))           ssssoooorrrrtttt____aaaarrrrrrrraaaayyyy((((3333))))
    3.  NNNNAAAAMMMMEEEE
    4.       sort_array() - sort an array
    6.  SSSSYYYYNNNNOOOOPPPPSSSSIIIISSSS
    7.       mixed *sort_array( mixed *arr, string fun, object ob );
    8.       mixed *sort_array( mixed *arr, function f );
    9.       mixed *sort_array( mixed *arr, int direction );
    11.  DDDDEEEESSSSCCCCRRRRIIIIPPPPTTTTIIIIOOOONNNN
    12.       The first form returns an array with the same elements as
    13.       `arr', but quicksorted in ascending order according to the
    14.       rules in `ob->fun()'.  `ob->fun()' will be passed two
    15.       arguments for each call.  It should return -1, 0, or 1,
    16.       depending on the relationship of the two arguments (lesser,
    17.       equal to, greater than).
    19.       The second form does the same thing but allows a function
    20.       pointer to be used instead.
    22.       The third form returns an array with the same elements as
    23.       'arr', but quicksorted using built-in sort routines.  A
    24.       'direction' of 1 or 0 will quicksort in ascending order,
    25.       while a 'direction' of -1 will quicksort in descending
    26.       order.  A limitation of the built-in sort routines is that
    27.       the array must be homogeneous, composed entirely of a single
    28.       type, where that type is string, int, or float.  Arrays of
    29.       arrays are sorted by sorting based on the first element,
    30.       making database sorts possible.
    32.  SSSSEEEEEEEE AAAALLLLSSSSOOOO
    33.       filter_array(3), map_array(3), strcmp(3)
    35.  Page 1                                          (Writen 5/23/97)