浙江大学--数据结构 mooc--01 复杂度3 二分查找

题目：https://pintia.cn/problem-sets/1077214780527620096/problems/1077218398207094786

Position BinarySearch( List L, ElementType X )
{
  ElementType i=1;
  ElementType j=L->Last;
  ElementType mid;
  mid=(j-i)/2+i;
  while(j>i)
  {
    if(X==L->Data[j])
    {
      return j;
    }
    if(X==L->Data[mid])
    {
      return mid;
    }
    else if(X>L->Data[mid])
    {
      i=mid+1;
      mid=(j-i)/2+i;
    }
    else
    {
      j=mid-1;
      mid=(j-i)/2+i;
    }
  }
  return NotFound;
}