Strange binary sort algorithm implementation, very weird

BinarySortStrange.java

class Solution {
    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        int result = -1;
        int n = nums.length;

        while (n >= 1) {
            int middle = (left + right) / 2;
            if (target == nums[middle]) {
                return middle;
            } else if (target < nums[middle]) {
                right = middle - 1;
            } else if (target > nums[middle]) {
                left = middle + 1;
            }
            n = n / 2;
        }

        return result;
    }
}