Download presentation

Presentation is loading. Please wait.

Published byUlysses Ottey Modified over 4 years ago

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

Similar presentations

OK

Sequential Search slides. Searching Searching : –Information retrieval is one of the most important application of computers. –EG: Looking for a Name.

Sequential Search slides. Searching Searching : –Information retrieval is one of the most important application of computers. –EG: Looking for a Name.

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google