Topic study hub
Searching algorithms
Official AQA 7517 section 4.3.4.
0
Objectives
10
Flashcards
10
Questions
76 min
Study time
AqaA LevelComputer ScienceFundamentals of algorithms
Choose a revision tool
Start revising Searching algorithms
Syllabus checklist
What you need to know
0 objective pages available
Linear search1 objectives
- Linear search: Know and be able to trace and analyse the complexity of the linear search algorithm. Time complexity is O(n).
Binary search1 objectives
- Binary search: Know and be able to trace and analyse the time complexity of the binary search algorithm. Time complexity is O(log n).
Binary tree search1 objectives
- Binary tree search: Be able to trace and analyse the time complexity of the binary tree search algorithm. Time complexity is O(log n).
Key terms
Linear searchTime complexityBinary searchRoot node
Exam tips
- Show the comparison sequence: When tracing a linear search, write down each value checked and count the comparisons carefully.
- Show every middle value when tracing: For each step, write the middle item checked and state which half remains.
Common mistakes
- Stopping too soon when a value is absent: Continue checking every remaining item unless a matching target is found. Absence can be reported only after the list has been fully examined.
- Using binary search on unordered data: Ensure the data is ordered first, because binary search relies on the order to decide which half to discard.
Practice preview
- What does a linear search do when searching a list for a target value?
- A linear search examines the list [14, 6, 21, 9] for the value 21. How many comparisons are made, and at which zero-based index is the value found?
- A linear search examines the list [3, 8, 12] for the value 10. How many comparisons are required before the search can report that the value is not present?
Continue by objective
Objectives are grouped by subtopic so students can jump straight to the exact skill they want to revise.
Related topics