Search_N_Sort

For a binary search to work, the following is true ...

• Items must be in order

• Items are not stored in any useful order

• Items do not need to be stored in any useful order

For a linear search to work, the following is true ...

• Items must be in order

• Items are not stored in any useful order

• Items do not need to be stored in any useful order

Where does a binary search start?

• The middle item

• A hashing function on the key

• The first item

Where does a linear search start?

• The middle item

• A hashing function on the key

• The first item

Linear search ...

• Delivers the location of the item to be found unless there is a collision or does not exist

• Halves the set items to search after each comparison until there are no more to check

• Searches each item in the sequence until the item is found or there are no more items to check

Suitable for large numbers of items

• Binary search

• Hash table search

• Linear search

Suitable for small numbers of items

• Binary search

• Hash table search

• Linear search

Which type of lists or data sets are linear searching algorithms used for?

• Unsorted lists or data sets
• Sorted lists or data sets

Which type of lists or data sets are binary searching algorithms used for?

• Unsorted lists or data sets
• Sorted lists or data sets

A linear search is to be performed on the list:
12   6   8  1  3
How many comparisons would it take to find number 1?

• 1
• 2
• 3
• 4