1. 1. _____________ search: Each item in the list is checked in order.
2. __________ search: An ordered list is divided in 2 with each comparison.

2. Mary wishes to use a binary search to search the following list of numbers for a specific number. Discuss

3. The following shows a binary search for the number '9'. What is the next step in the algorithm?

4. The following pseudo-code describes what type of search?

5. The length of the search is very important for obvious reasons. In a
__________ search the worst case scenario is you have to check half the values and
in a __________ search the worst case scenario is you have to check all the values.

6. Compare the algorithms for a Linear and Binary Search. Which of the following statements is true?

7. Can you explain why the following algorithm, when run, produces the output: "FALSE"?

8. Given the following list, you are searching for the name 'Adam'. Would it be easiest/best/most efficient to use a Linear or Binary Search?

9. You are given a random list of student scores. It is best to use a Binary Search in this case.

10. If the list is large and static e.g. telephone number database, then a binary search is very fast compared to linear search.

11. The following shows an insertion sort and the stages involved. What is the output in the next stage? (what sequence of numbers)?

2,3,9,12,15

2,3,9,12,15,2,7,15

3,9,12,15,2,7,15

3,12,9,15,2,7,15

12. Below is the algorithm for a linear search. What is missing? (or what could be added to further improve the algorithm?)

13. A user has a database of 100,000 people and needs to search through to find one person. In a linear search the ?.

14. This technique iterates over the sequence, one item at a time, until the specific item is found or all items have been examined

15. To evaluate the efficiency of the the binary search algorithm, assume the sorted sequence contains n items. We need to determine the ?..