ConceptSystems & CS
Linear search complexity
A brute-force search algorithm that examines list elements sequentially, taking linear time in the worst case regardless of sorting.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.