Breaking News: Grepper is joining You.com. Read the official announcement!

recursive binary search

Add Answer

Friendly Falcon answered on January 4, 2022 Popularity 10/10 Helpfulness 5/10

answer recursive binary search

related Code of recursive binary search

related C++, binary search recursive

recursive binary search

Comment

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);
    }
}

Popularity 10/10 Helpfulness 5/10 Language cpp

Source: iq.opengenus.org

Tags: binary-search c++

Link to this answer
Share Copy Link

Contributed on Jan 04 2022

Friendly Falcon

0 Answers Avg Quality 2/10

Closely Related Answers

Code of recursive binary search

Comment

# Code recursive binary search.
def binarySearchAlgorithm(arr, l, r, x):
	if r >= l:
		mid = l + (r - l) 
		if arr[mid] == x:
			return mid
		elif arr[mid] > x:
			return binarySearch(arr, l, mid-1, x)
		else:
			return binarySearch(arr, mid + 1, r, x)
	else:
		return -1
arr = [3, 43, 56, 96]
find = 56
result = binarySearchAlgorithm(arr, 0, len(arr)-1, find)
if result != -1:
	print("Element is present at index % d" % result)
else:
	print("Element is not present in array")

Popularity 9/10 Helpfulness 3/10 Language python

Source: softhunt.net

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Apr 10 2022

Outrageous Ostrich

0 Answers Avg Quality 2/10

C++, binary search recursive

Comment

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;
        
    }
};

Popularity 9/10 Helpfulness 2/10 Language cpp

Source: leetcode.com

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Jun 12 2022

Mib

0 Answers Avg Quality 2/10

recursive binary search

Contents

More Related Answers

recursive binary search

Closely Related Answers

Code of recursive binary search

C++, binary search recursive

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.