Sign inSign in
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.
Watch it explained

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.

For loop1List1Worst-case analysis1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.