Answered step by step
Verified Expert Solution
Link Copied!

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

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Computer Performance Engineering 10th European Workshop Epew 2013 Venice Italy September 17 2013 Proceedings

Authors: Maria Simonetta Balsamo ,William Knottenbelt ,Andrea Marin

2013 Edition

3642407242, 978-3642407246

More Books

Students also viewed these Programming questions

Question

Explain the process of MBO

Answered: 1 week ago

Question

What is the role of an auditor? AppendixLO1

Answered: 1 week ago