| Searching for Data |
|
|
|
|
|
|
|
|
|
|
|
| • | Thinking
about binary search, we should notice a |
|||||||||
| few
facts: |
||||||||||
| • | #1)
The binary search is NOT good for searching |
|||||||||
| linked
lists. Because it requires jumping back and |
||||||||||
| forth
from one end of the list to the middle; this is |
||||||||||
| easy
with an array but requires tedious traversal |
||||||||||
| with
a linear linked list. |
||||||||||
| • | #2)
The binary search REQUIRES that your data |
|||||||||
| be
arranged in sorted order! Otherwise, it is not |
||||||||||
| applicable. |
||||||||||