This chapter addresses the problem of retrieving data as quickly as possible. While the searching techniques described are programmed for data in main memory, they are applicable to secondary storage such as magnetic disk databases, as well.
The algorithms covered include linear searching, binary searching, hashing and linked lists.
Associated with this chapter is also a graphical demonstration of the binary search method. This is available on the associated diskette and is also accessible over the Internet.
Have a look at the sample programs for this chapter
Browse other websites on this topic
Come back to the main page