C# 已排序好的数组中查找数的位置

最新推荐文章于 2024-07-11 19:45:30 发布

weixin_30908649

最新推荐文章于 2024-07-11 19:45:30 发布

阅读量814

点赞数

文章标签： c# 测试

原文链接：http://www.cnblogs.com/Ligeance/archive/2012/03/14/2395984.html

版权

        static int FindNumber(int[] array, int num)
        {
int result = -1;
if (array == null)
            {
return result;
            }

for (int i = 0; i < array.Length - 1; i++)
            {
if (array[i] > array[i + 1])
                {
throw new Exception("input array is not sorted properly.");
                }
            }

for (int j = 0; j < array.Length; j++)
            {
if (array[j] == num)
                {
                    result = j;
                }
            }
return result;
        }

static int FindNumber1(int[] array, int num)
        {
int result = -1;
if (array == null)
            {
return result;
            }
for (int i = 0; i < array.Length -1; i++)
            {
if (array[i] > array[i +1])
                {
throw new Exception("input array is not softed properly.");
                }
            }

int low = 0;
int mid = 0;
int high = array.Length - 1;

while (low<=high)
            {
                mid = (low + high) / 2;
if (array[mid] == num)
                {
                    result = mid;
break;
                }
if (array[mid] < num)
                {
                    low = mid + 1;
                }
else
                {
                    high = mid - 1;
                }
            }
return result;
        }