Site Links
Question #1
In a sequential search, each record in the database is compared in the order it appears until the desired record is found.
Question #2
A sequential search is never faster than a binary search.
Question #3
The item upon which the search is based is called the key.
Question #4
When the amount of data is small, the binary search is the best choice for searching the data.
Question #5
A sequential search can be implemented using a while loop.