recursive binary search
int binarySearch(int[] A, int low, int high, int x)
{
if (low > high) {
return -1;
}
int mid = (low + high) / 2;
if (x == A[mid]) {
return mid;
}
else if (x < A[mid]) {
return binarySearch(A, low, mid - 1, x);
}
else {
return binarySearch(A, mid + 1, high, x);
}
}C++, binary search recursive
class Solution {
public:
int search(vector<int>& nums, int target) {
int ret = 0;
if (nums.size() == 0)
return -1;
if (nums[nums.size()/2] < target) {
vector<int> halfVec(nums.begin()+nums.size()/2+1,nums.end());
auto retIdx = search(halfVec,target);
if (retIdx == -1) return -1;
ret += retIdx + nums.size()/2+1;
} else if (nums[nums.size()/2] > target) {
vector<int> halfVec(nums.begin(),nums.begin()+nums.size()/2);
ret = search(halfVec,target);
} else {
ret = nums.size()/2;
}
return ret;
}
};Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
