Sign inSign in
ConceptSystems & CS

Bubble sort pseudo code

Bubble sort is implemented by repeating nn times an inner loop from 00 to n−2n-2 that swaps adjacent out-of-order elements.
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

    4

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

    Concepts3

    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.