CS Edexcel 1.2c - Linear and Binary Search

What is the main characteristic of a linear search algorithm?

• It checks each item one by one until it finds a match.
• It requires the data to be sorted before searching.
• It always finds the item in the middle of the data set.
• It divides the data set into halves repeatedly.

What must be true about the data set for a binary search to work?

• It must have a maximum of 10 items.
• It must be ordered.
• It must contain only numbers.
• It must be unsorted.

Which search algorithm is more efficient for large data sets?

• Linear search
• Binary search
• Both are equally efficient
• Neither is efficient

In a linear search, what happens if the item is not found by the end of the data set?

• It automatically switches to a binary search.
• The algorithm starts over from the beginning.
• The algorithm stops and indicates the item was not found.
• The search continues indefinitely.

When performing a binary search, what do you do if the middle item is higher than the search item?

• You swap the positions of the items.
• You start a linear search from that point.
• You discard the upper half of the data set.
• You discard the lower half of the data set.

How does a binary search determine which half of the data to search next?

• By reversing the order of the data set.
• By randomly selecting an index to check.
• By comparing the search item with the middle item.
• By checking the first item of the array.

What is a key advantage of using a binary search over a linear search?

• It uses less memory.
• It can find items faster in a sorted data set.
• It works with unsorted data sets.
• It is easier to implement.

Which of the following best describes the process of a binary search?

• It checks every item in the data set.
• It narrows down the search area by half each time.
• It requires multiple iterations through the entire data set.
• It uses a fixed number of comparisons regardless of data size.

What is the purpose of the 'found' flag in both search algorithms?

• To count the number of comparisons made.
• To signal when the item has been located.
• To track the position of the item in the array.
• To indicate whether the algorithm should continue searching.

Which statement best describes the efficiency of a binary search compared to a linear search?

• Linear search is generally faster for large data sets.
• Binary search can be faster due to its divide-and-conquer approach.
• Linear search requires sorted data to function effectively.
• Binary search examines every element in the data set.