For find sqrt(x) question using binary search

```
public class Solution {
public int mySqrt(int x) {
if(x <= 1) return x;
int left = 1, right = x;
while(left < right) {
int mid = left + (right - left) /2; /*this line*/
if(mid <= x / mid) {
left = mid + 1;
}
else right = mid;
}
return left - 1;
}
}
```

if I write the expression for mid as mid=low+(high-low)>>1; i get TLE, isn't bit shift supposed to be faster? I usually use (low+high)>>1 instead of (low+high)/2 in binary search questions, is that less efficient?