In
a linear search the search is done over the entire list even if the
element to be searched is not available. Some of our improvements work
to minimize the cost of traversing the whole data set, but those
improvements only cover up what is really a problem with the algorithm.
By
thinking of the data in a different way, we can make speed improvements
that are much better than anything linear search can guarantee.
Consider a list in sorted order. It would work to search from the
beginning until an item is found or the end is reached, but it makes
more sense to remove as much of the working data set as possible so that
the item is found more quickly.
0 comments:
Post a Comment