基于范围查找当前项的C#数据结构

using System;
using System.Collections.Generic;

class Program
{
    static int BinarySearch(List<int> list, int target)
    {
        int left = 0;
        int right = list.Count - 1;

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

            if (list[mid] == target)
            {
                return mid;
            }
            else if (list[mid] < target)
            {
                left = mid + 1;
            }
            else
            {
                right = mid - 1;
            }
        }

        return -1; // 未找到
    }

    static void Main(string[] args)
    {
        List<int> numbers = new List<int> { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
        int target = 5;

        int index = BinarySearch(numbers, target);

        if (index != -1)
        {
            Console.WriteLine($"找到目标值 {target} 在索引 {index}");
        }
        else
        {
            Console.WriteLine($"未找到目标值 {target}");
        }
    }
}