Download presentation

Presentation is loading. Please wait.

Published byUlysses Ottey Modified over 3 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

1 Chapter 7 Arrays. 2 Outline and Objective In this chapter we will –Learn about arrays One-dimensional arrays Two-dimensional arrays –Learn about searching.

1 Chapter 7 Arrays. 2 Outline and Objective In this chapter we will –Learn about arrays One-dimensional arrays Two-dimensional arrays –Learn about searching.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on save the tiger project Ppt on combination of resistances organization Ppt on polynomials of 90 Ppt on unstructured data analysis Ppt on types of angles formed when two parallel lines are intersected by a transversal Ppt on the greatest dictator of the world Ppt on beer lambert law equation Ppt on depth first search adjacency Free ppt on motivation theories Ppt on as 14 amalgamation meaning