Learning objective
Linear search: Know and be able to trace and analyse the complexity of the linear search algorithm. Time complexity is O(n).
Read the explanation, check the common trap, then practise with flashcards and questions.
At a glance
0
Flashcards
0
Questions
Topic
Searching algorithms
Subtopic
Linear search
Study support
Understand this objective
Quick explanation
Linear search: Know and be able to trace and analyse the complexity of the linear search algorithm. Time complexity is O(n)
- This point belongs to Searching algorithms, especially Linear search.
- You need to be able to linear search: Know and be able to trace and analyse the complexity of the linear search algorithm. Time complexity is O(n).
- Use the linked flashcards and practice questions to check recall, then practise applying the idea in an exam-style answer.
Why it matters
This objective helps connect Linear search to exam-style questions, flashcards, and revision notes for Searching algorithms.
Quick student answer
What does a linear search do when searching a list for a target value?
Direct answer
It checks items one at a time from the beginning until the target is found or the list ends.
Key terms
- Linear search: An algorithm that examines list elements sequentially until a target is found or all elements have been checked.
- Time complexity: A description of how the amount of work performed by an algorithm changes as the input size changes.
Common trap
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.
Related questions
Try this as a practice card
Question 1 of 4
Choose an answer, get feedback, then move sideways through the set.
Flashcard prompts
Flip through the key recall cards
Flashcard 1 of 4
Revision tools