DSA 2024 föreläsning 04 2024-01-31
Thomas Padron-McCarthy · 89:51
This is a university data structures and algorithms lecture. It finishes the insertion sort example, shows how loop invariants support correctness proofs, and introduces time complexity using Θ (theta) notation and th...