如何修复我的c#二进制搜索算法？

Array.Sort(array);

int left = 0;
int right = array.Length - 1;

while (left <= right)
{
    int mid = left + (right - left) / 2; // 防止溢出
    if (array[mid] == target)
    {
        return mid; // 找到目标值
    }
    else if (array[mid] < target)
    {
        left = mid + 1; // 更新左边界
    }
    else
    {
        right = mid - 1; // 更新右边界
    }
}
return -1; // 未找到目标值

int mid = left + (right - left) / 2;

public static int BinarySearch(int[] array, int target)
{
    int left = 0;
    int right = array.Length - 1;

    while (left <= right)
    {
        int mid = left + (right - left) / 2;
        if (array[mid] == target)
        {
            return mid; // 目标值找到
        }
        else if (array[mid] < target)
        {
            left = mid + 1; // 在右侧子数组中继续搜索
        }
        else
        {
            right = mid - 1; // 在左侧子数组中继续搜索
        }
    }
    return -1; // 目标值未找到
}