Sign inSign in
ConceptSystems & CS

Linear search

A brute-force search method that checks every element in a list sequentially until the desired element is found.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • David J. Malan

    Harvard University · Undergraduate

    A search algorithm that checks every element in a list sequentially from one end to the other.

Lectures that assume it

3

Connections

13

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

2 lecturers. 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.