Answered step by step
Verified Expert Solution
Question
1 Approved Answer
ySearch(arr[],1,r,x) { if (r>= 1) { int mid = 1 + (r-1)/2; if (arr[mid] == x) return mid; if (arr[mid] > x) return binarySearch(arr, I,
ySearch(arr[],1,r,x) { if (r>= 1) { int mid = 1 + (r-1)/2; if (arr[mid] == x) return mid; if (arr[mid] > x) return binarySearch(arr, I, mid-1, x); return binarySearch(arr, mid +1,r,x); } return -1; } main() { arr[] = {7, 12, 23, 32, 45, 52, 64, 78, 87,98 }; n=no. of elements in array: x= no. to search; result = binarySearch(arr, 0, n-1, x); if (result == -1) printf("Element is not present in array") else printf("Element is present at index %d", result); }
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started