and
.BR lsearch ()
perform a linear search for
-\fIkey\fP in the array \fIbase\fP which has \fI*nmemb\fP elements of
-\fIsize\fP bytes each.
+.I key
+in the array
+.IR base
+which has
+.I *nmemb
+elements of
+.I size
+bytes each.
The comparison function referenced by
-\fIcompar\fP is expected to have two arguments which point to the
-\fIkey\fP object and to an array member, in that order, and which
-returns zero if the \fIkey\fP object matches the array member, and
+.I compar
+is expected to have two arguments which point to the
+.I key
+object and to an array member, in that order, and which
+returns zero if the
+.I key
+object matches the array member, and
nonzero otherwise.
.PP
If
.BR lsearch ()
-does not find a matching element, then the \fIkey\fP
-object is inserted at the end of the table, and \fI*nmemb\fP is
+does not find a matching element, then the
+.I key
+object is inserted at the end of the table, and
+.I *nmemb
+is
incremented.
In particular, one should know that a matching element
exists, or that more room is available.