1. 82134657109111214130 64141325335143538472939597966 Binary Search lo Binary search. Given a key and sorted array a[], find index i such that a[i] = key, or report that no such index exists. Invariant. Algorithm maintains a[lo]  key  a[hi]. Ex. Binary search for 33. hi

2. Binary Search Binary search. Given a key and sorted array a[], find index i such that a[i] = key, or report that no such index exists. Invariant. Algorithm maintains a[lo]  key  a[hi]. Ex. Binary search for 33. 82134657109111214130 64141325335143538472939597966 lo hi mid

3. Binary Search Binary search. Given a key and sorted array a[], find index i such that a[i] = key, or report that no such index exists. Invariant. Algorithm maintains a[lo]  key  a[hi]. Ex. Binary search for 33. 82134657109111214130 64141325335143538472939597966 lo hi

4. Binary Search Binary search. Given a key and sorted array a[], find index i such that a[i] = key, or report that no such index exists. Invariant. Algorithm maintains a[lo]  key  a[hi]. Ex. Binary search for 33. 82134657109111214130 64141325335143538472939597966 lo midhi

5. Binary Search Binary search. Given a key and sorted array a[], find index i such that a[i] = key, or report that no such index exists. Invariant. Algorithm maintains a[lo]  key  a[hi]. Ex. Binary search for 33. 82134657109111214130 64141325335143538472939597966 lohi

6. Binary Search Binary search. Given a key and sorted array a[], find index i such that a[i] = key, or report that no such index exists. Invariant. Algorithm maintains a[lo]  key  a[hi]. Ex. Binary search for 33. 82134657109111214130 64141325335143538472939597966 lohimid

7. Binary Search Binary search. Given a key and sorted array a[], find index i such that a[i] = key, or report that no such index exists. Invariant. Algorithm maintains a[lo]  key  a[hi]. Ex. Binary search for 33. 82134657109111214130 64141325335143538472939597966 lo hi

8. Binary Search Binary search. Given a key and sorted array a[], find index i such that a[i] = key, or report that no such index exists. Invariant. Algorithm maintains a[lo]  key  a[hi]. Ex. Binary search for 33. 82134657109111214130 64141325335143538472939597966 lo hi mid

9. Binary Search Binary search. Given a key and sorted array a[], find index i such that a[i] = key, or report that no such index exists. Invariant. Algorithm maintains a[lo]  key  a[hi]. Ex. Binary search for 33. 82134657109111214130 64141325335143538472939597966 lo hi mid