How does a linear search work?

It checks each item in turn from the start

It checks the middle item first

How does a merge sort work?

It splits the list into halves, then merges them back in order

It swaps neighboring items again and again

It picks items at random until they're in order

It searches for each item in turn

One item at a time, putting each in its place

By comparing only the first two items

1. Which search only works on a list that is already sorted?
- Correct answer: Binary search
- Linear search
- Both of them
- Neither of them
2. How does a linear search work?
- Correct answer: It checks each item in turn from the start
- It checks the middle item first
- It checks only the last item
- It checks items at random
3. In a bubble sort, which items are compared?
- Correct answer: Neighboring pairs
- The first and the last
- The middle and the end
- Random pairs
4. How does a merge sort work?
- Correct answer: It splits the list into halves, then merges them back in order
- It swaps neighboring items again and again
- It picks items at random until they're in order
- It searches for each item in turn
5. How does an insertion sort build the sorted list?
- Correct answer: One item at a time, putting each in its place
- By splitting the list in half
- By comparing only the first two items
- By reversing the list
6. Which sort is usually quicker on a long, unsorted list?
- Correct answer: Merge sort
- Bubble sort
- They always take the same time
- Neither will finish