Comparing searching algorithms

12 questions

1. What is the name of the algorithm that checks each item in a list one by one until the desired item is found?
2. Which of these is true about linear search?
3. What does binary search do with the data set at each step?
4. What must be true about a list for binary search to work?
5. Which of these is an example of a sorted list?
6. How many comparisons does binary search make in the best-case scenario?
7. Arrange the steps of a linear search in the correct order:
8. Arrange the steps of binary search:
9. Match the situation to the concept:
10. What is a trace table used for?
11. Which searching algorithm is more complex to write?
12. Which of these is true about linear search?

License: OGL