This document describes a binary search algorithm to find a target item in a sorted array. It initializes an index and boolean flag, then searches through half of the remaining array elements at each step until finding the target item or reaching the end. If found, it outputs the item; if not found, it outputs the last position checked.

2. Start
Search
Item
Set index to
1
Set found to
false
While not
found and
not end of
array
If item =
search
Found =
true
If
true
Item
output
found
Item not
found
Location =
index
No Yes
Yes
YesNo
No

6. Start
Input item
searching
for
Set found to false
Set bottom to 0
Set top to (MAX -1)
elements
While
bottom <=
top and not
found
Middle = (bottom +
top)/2
If list at
middle =
item
Found = true
If list at
middle <
item
Location = middle
Bottom = middle + 1
Top = middle - 1
If found =
true
Output
item was
not found
Output
location
item found
Stop
Yes
No
Yes
Yes
Yes
No
Yes
No