- Engineering
- Computer Science
- write a proof by induction to show the correctness of...
Question: write a proof by induction to show the correctness of...
Question details
Write a proof by induction to show the correctness of the binary search code given below
![2. Write a proof by induction to show the correctness of the binary search code given below: /1 Find index of x in sorted array A[p..r]. Return -1 if x is not in A[p..r]. int binarySearch ( A, p, r, x) Pre: A[p..r] is sorted if p>r then return -1 else q (p+r)/2 if x <AIq] then else if xA[q] then else // x A[q] return binarySearch A, p, q-1, x) return q return binarySearch ( A, q+1, r, x)](https://homework-api-assets-production.s3.ap-southeast-2.amazonaws.com/uploads/store/849511137/16040303065f982e7e31ffcd5def28503ab8b48bb7.png)
Solution by an expert tutor
