A Balanced Introduction to Computer Science
For Introduction to Computing and the Web courses in departments of Math and Computer Science.
Bridge Page: www.prenhall.com/reed
Author Website: www.dave-reed.com/book
Results 1-3 of 12
Although sequentially searching a list of 10 or 100 items might be feasible, this
approach becomes impractical when a list ... Binary. Search. Fortunately, there is
a more efficient algorithm for searching a list, as long as the list adheres to some
Because the entry at that position is indeed “Illinois”, the search concludes
successfully. The Web page search.html (accessible at http://dave-reed.com/book
) provides an interactive tool for studying the behavior of the binary search
The sequential search algorithm, which can be used to find a particular item in a
list, is an example of an O(N) algorithm, where N is the number of items in the list.
Binary search, which can be used when the list is ordered, is an example of an ...
Internet and the Web
HTML and Web Pages
The Internet and the Web
19 other sections not shown