GCSE Year 10 Quiz Searching and Sorting Algorithms

What does a linear search do?

• Checks each item one by one

• Jumps to the middle

• Skips half the list

• Sorts the list first

Why can linear search be used on unsorted lists?

• It doesn’t need order

• It uses binary logic

• It starts from the end

• It skips duplicates

What is an index in a list?

• The position of an item

• The size of an item

• The last number

• The total number

What is a disadvantage of linear search?

• It can be slow on large lists

• It sorts the list

• It needs internet

• It works only on numbers

Which real-life task is similar to linear search?

• Looking through a bag

• Typing on a keyboard

• Drawing a picture

• Checking your pulse

What must a list be before using binary search?

• Sorted

• Reversed

• Encrypted

• Padded with zeros

How does binary search begin?

• Checking the middle item

• Scanning the first item

• Swapping values

• Checking the largest item

If the target is less than the middle item, what does binary search do?

• Searches the lower half

• Restarts

• Ends immediately

• Searches randomly

Why is binary search efficient?

• It halves the list each time

• It looks at every item

• It counts backwards

• It skips to the end

What is a disadvantage of binary search?

• Needs sorted data

• Too simple

• Hard to code

• Only works on text