// Function: FindStringInSortedArray // Usage: index = FindStringInSortedArray (key, array, n) // ------------------------------------------------------------- // The function searchs the array looking for the specified key. // The argument n specifies the effective size of the array, which must // be sorted according to the lexicographic order imposed by StringCompare. // If the key is found, the order imposed by StringCompare. If the key is found, the order imposed by // StringCompare. If the key is found, the function returns the index in the array at which that key appears. // (If the key appears more than once in the array, any of the mathcing indices may be returned). If the key // does not exist in the array, the funcion returns-1. In this implementation, FindStringInSortedArray is simply // a wrapper all the work is done by the recursive function BinarySearch.

FindStringInSortedArray.c

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．