Sign inSign in
ConceptSystems & CS

Complexity of bubble sort

The worst-case time complexity of bubble sort is Θ(n2)\Theta(n^2) because it performs up to nn passes over a list of length nn, with each pass taking linear time.
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.

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.