移位操作一定比除法操作的效率高吗？

测试代码:

public class Demo01 {
   
    public int search(int[] nums,int target){
   
        int L = 0,R = nums.length-1;
        while (L<=R){
   
            int M = L + (R - L)/2;
            if(nums[M] == target){
   
                return M;
            }else if (nums[M] < target){
   
                L = M+1;
            }else {
   
                R = M-1;
            }
        }
        return -1;
    }