对字符串数组中的字符串(多个实例)进行递归二进制搜索- C#

using System;

class Program
{
    static int RecursiveBinarySearch(string[] array, string target, int left, int right)
    {
        if (left > right)
            return -1;  // 目标字符串不存在于数组中

        int mid = (left + right) / 2;

        int compareResult = string.Compare(target, array[mid]);

        if (compareResult == 0)
            return mid;
        else if (compareResult < 0)
            return RecursiveBinarySearch(array, target, left, mid - 1);
        else
            return RecursiveBinarySearch(array, target, mid + 1, right);
    }

    static void Main()
    {
        string[] array = { "apple", "banana", "cherry", "date", "grape" };
        string target = "date";

        Array.Sort(array);

        int index = RecursiveBinarySearch(array, target, 0, array.Length - 1);

        if (index >= 0)
            Console.WriteLine("目标字符串在数组中的索引位置：" + index);
        else
            Console.WriteLine("目标字符串不存在于数组中");
    }
}