C# 算法

    /// <summary>
    /// 二分法查询值所在位置
    /// </summary>
    /// <param name="value">要查询的值</param>
    /// <returns>值所在索引</returns>
    private static int SearchIndex(long value)
    {
        int Index = -1;
        int low = 0;
        int high =  Data.Count - 1;

        while (low <= high)
        {
            int middle = (low + high) >> 1;
            long temp = Data[middle];

            if (temp == value)
            {
                Index = middle;
                return Index;
            }
            if (temp > value)
            {
                high = middle - 1;
            }
            else
            {
                low = middle + 1;
            }
        }
        return Index;
    }