BINARY SEARCHING( BINARY CHOPPING )- THE KEY IN THE INDEX TO BE BIN...

2. Binary searching( binary chopping )

- The key in the index to be binary search must be in sequence and form a complete

set

- The search starts at the midpoint of the index and then moves half way to the left

or right(down or up) depending upon whether are wanted key is less than or

greater than the midpoint key

- In pracice, the index is unlikely to as convenient as this example because it is not

always possible to exactly halve each sucessive move(complete exact holvingis

possible only when the total number of keys in the index is 2

⁰

-1)

- The average number of examinations comparisons is (log

2

k )

^-1

( k is the number of

keys in the index)