众所周知,二分查找有很多种,每一种所对应的边界处理也不一样。那么请问如何区别下面的这些边界问题呢?
l < r
l <= r
if (x <= a[mid])
if(x >= a[mid]
l = mid
l = mid + 1
r = mid
r = mid - 1
l = 0, r = n - 1
l = 1,r = n