Sign inSign in
ConceptSystems & CS

No-branch minimum

A technique to find the minimum of two integers without using a conditional branch by using bitwise operations and boolean arithmetic.
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.

Bitwise operations1Ternary operator1Two's complement1

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    • Bit Hacksdefined by Charles Leiserson & Julian Shun

    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.