.fp 5 CW
..
.nr ;G \\n(.f
.Af "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7" "\\$8" "\\$9"
\\*(;G
..
.aF 5 \\n(.f "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7"
..
.aF 5 1 "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7"
..
.aF 1 5 "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7"
..
0
..
..
HSORT 3
NAME
hsort - array heap sort
SYNOPSIS
.EX
#include <ast.h>
void strsort(char** array, int elements, int (*compare)(const char* a, const char* b));
DESCRIPTION
.L strsort
does a heap sort on the array of pointers
array with
elements elements using the comparison function
compare . compare returns
.L -1
if
a is lexicographically less than
b , .L 0
if
a is equal to
b , and
.L 1
if
a is lexicographically greater than
b .