Algorithm

01-Binary Search Algorithm

Flowchart
Begin:
Initialize variables low and high.
Enter Loop:
Loop continues as long as low <= high.
Find Midpoint:
Calculate mid index.
Compare:
Compare guess (middle value) with item.
If equal, return index.
If guess is greater, update high.
If guess is less, update low.
End Loop:
If loop exited and still no element found, return None.