int left = 0; int right = nums.length - 1; int mid = left + (right - left) / 2; while(left < right) { if (nums[mid] < target) { left = mid + 1; } else if (nums[mid] >= target) { right = mid; } mid = left + (right - left) / 2; } return mid;
已知有序序列b c d e f g q r s t,则在二分查找使用如上代码查找关键字b的过程中,先后进行比较的关键字依次是多少?()