What does a searching algorithm find out about a target value?
Whether the target is stored in ascending order.
Whether the target is greater than every list item.
Whether the target is the list’s middle value.
Whether the target is present in the list.
Flashcards for AQA GCSE Computer Science Searching algorithms, covering the key terms, algorithms and programming syntax you need to recall for Paper 1 and Paper 2. 20 cards, matched to the AQA GCSE Computer Science (8525) specification. Recall questions account for roughly 30% of marks at GCSE Computer Science, so these target the marks you can secure before the paper starts.