| Share this post! | Vote this! |
|
Searching for data is one of the fundamental fields of computing. Often, the
difference between a fast program and a slow one is the use of a good algorithm
for the data set. This article will focus on searching for data stored in a
linear data structure such as an array or linked list. Naturally, the use of a
hash table
or binary search
tree will result in more efficient searching, but more often than not an
array or linked list will
be used. It is necessary to understand good ways of searching data structures
not designed to support efficient search.
more...



0 comments:
Post a Comment