adplus-dvertising
frame-decoration

Question

How many times is the function recursive_binary_search() called when the following code is executed?
#include<stdio.h>
int recursive_binary_search(int *arr, int num, int lo, int hi)
{
      if(lo > hi)
       return -1;
      int mid = (lo + hi)/2;
      if(arr[mid] == num)
        return mid;
      else if(arr[mid] < num)
          lo = mid + 1;
      else
          hi = mid - 1;
      return recursive_binary_search(arr, num, lo, hi);
}
int main()
{
      int arr[5] = {1,2,3,4,5},num = 1,len = 5;
      int indx = recursive_binary_search(arr,num,0,len-1);
      printf("Index of %d is %d",num,indx);
      return 0;
}

a.

0

b.

1

c.

2

d.

3

Answer: (c).2

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. How many times is the function recursive_binary_search() called when the following code is executed?

Similar Questions

Discover Related MCQs

Q. Recursion is a method in which the solution of a problem depends on ____________

Q. Which of the following problems can be solved using recursion?

Q. Recursion is similar to which of the following?

Q. In recursion, the condition for which the function will stop calling itself is ____________

Q. Which of the following statements is true ?

Q. Which of the following methods can be used to find the factorial of a number?

Q. Which of the following recursive formula can be used to find the factorial of a number?

Q. What is the time complexity of the above recursive implementation to find the factorial of a number?

Q. What is the space complexity of the above recursive implementation to find the factorial of a number?

Q. Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?

Q. Which of the following is not a fibonnaci number?

Q. Which of the following methods can be used to find the nth fibonnaci number?

Q. Which of the following recurrence relations can be used to find the nth fibonacci number?

Q. What is the time complexity of the above recursive implementation to find the nth fibonacci number?

Q. What is the space complexity of the above recursive implementation to find the nth fibonacci number?

Q. Which of the following methods can be used to find the sum of first n natural numbers?

Q. Which of the following gives the sum of the first n natural numbers?

Q. What is the time complexity of the above iterative method used to find the sum of the first n natural numbers?

Q. What is the time complexity of the above recursive implementation used to find the sum of the first n natural numbers?

Q. Which of the following methods used to find the sum of first n natural numbers has the least time complexity?