Binary Search

What is the first step in a binary search algorithm?

• Check if the first item is what you're looking for.

• Set the left pointer to the first item.

• Sort the dataset in ascending order.

• Calculate the midpoint of the dataset.

What condition must be met for a binary search to work?

• The data must be in a random order.

• The data must be in descending order.

• The data must be in ascending order.

• No specific order is required.

How does a binary search compare to a linear search in terms of efficiency?

• Efficiency depends on the programming language.

• Both searches have the same efficiency.

• A binary search is more efficient on average.

• A binary search is always less efficient.

What happens if the item you're looking for is greater than the item at the midpoint in a binary search?

• Repeat the search on the right half.

• End the search.

• Repeat the search on the entire dataset.

• Repeat the search on the left half.

What is the result of performing integer division when calculating the midpoint in a binary search?

• The largest number in the dataset.

• A decimal number.

• A whole number without rounding.

• The smallest number in the dataset.

In the provided example, what is the initial value of the right pointer?

• 0

• 7

• 5

• 3

What happens when the item you're looking for is not found at the midpoint?

• The search space is halved.

• The search algorithm restarts.

• The search ends immediately.

• The dataset is re-sorted.

What is the purpose of the 'found' Boolean flag in the pseudocode?

• To mark the midpoint.

• To indicate whether the item has been found.

• To indicate the end of the dataset.

• To signal that the search is complete.

What does the GCSE specification require students to understand about algorithms?

• The history of each algorithm.

• How to apply the algorithm in all programming languages.

• The main steps and prerequisites of an algorithm.

• Only the code for each algorithm.

What additional resources are provided for understanding algorithms?

• A private tutor.

• A series of lectures at a university.

• An online course with a certificate.

• A book called 'Essential Algorithms for A Level Computer Science'.