Question
#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[8] = {0,0,0,0,3,5,6,7},num = 0,len = 8;
int indx = recursive_binary_search(arr,num,0,len-1);
printf("Index of %d is %d",num,indx);
return 0;
}a.
Index of 0 is 0
b.
Index of 0 is 1
c.
Index of 0 is 2
d.
Index of 0 is 3
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. What is the output of the following code?
Similar Questions
Discover Related MCQs
Q. Recursion is a method in which the solution of a problem depends on ____________
View solution
Q. Which of the following problems can be solved using recursion?
View solution
Q. Recursion is similar to which of the following?
View solution
Q. In recursion, the condition for which the function will stop calling itself is ____________
View solution
Q. Which of the following statements is true ?
View solution
Q. Which of the following methods can be used to find the factorial of a number?
View solution
Q. Which of the following recursive formula can be used to find the factorial of a number?
View solution
Q. What is the time complexity of the above recursive implementation to find the factorial of a number?
View solution
Q. What is the space complexity of the above recursive implementation to find the factorial of a number?
View solution
Q. Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?
View solution
Q. Which of the following is not a fibonnaci number?
View solution
Q. Which of the following methods can be used to find the nth fibonnaci number?
View solution
Q. Which of the following recurrence relations can be used to find the nth fibonacci number?
View solution
Q. What is the time complexity of the above recursive implementation to find the nth fibonacci number?
View solution
Q. What is the space complexity of the above recursive implementation to find the nth fibonacci number?
View solution
Q. Which of the following methods can be used to find the sum of first n natural numbers?
View solution
Q. Which of the following gives the sum of the first n natural numbers?
View solution
Q. What is the time complexity of the above iterative method used to find the sum of the first n natural numbers?
View solution
Q. What is the time complexity of the above recursive implementation used to find the sum of the first n natural numbers?
View solution
Q. Which of the following methods used to find the sum of first n natural numbers has the least time complexity?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
