Prove the correctness of Binary Search through the use of a loop invariant (which you should prove by induction). Assume that a is sorted, and that n is the number of elements in a. int BinarySearch(int

Prove the correctness of Binary Search through the use of a loop invariant (which you should prove by induction). Assume that a is sorted, and that n is the number of elements in a. int BinarySearch(int *a, int n, int x) { int L = 0, r = n-1; while (L <= r) { int m = (L+r)/2; if (a[m] == x) return m; if (a[m] < x) L = m+1; else r = m-1; } return -1; }

1 Answer

Prove the correctness of Binary Search through the use of a loop invariant (which you should prove by induction). Assume that a is sorted, and that n is the number of elements i…

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

Related questions

Categories

Other Questions