Sign inSign in
ConceptSystems & CS

Iterative algorithm

A procedure for computation that uses constant space without accumulating deferred operations as arguments grow.
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.

  • Ana Bell

    MIT · Introductory

    An iterative algorithm uses looping constructs like while and for loops to execute a task repeatedly, capturing computation in state variables that update on each iteration.

Lectures that assume it

1

Connections

9

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

Concepts6

Lectures3

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.