DSA 2024 föreläsning 12 2024-02-23: Hashtabeller. B-träd. Kortaste väg i en DAG.
Thomas Padron-McCarthy · 88:21
Hash tables give near-constant-time lookups, but they don't keep keys in order and they depend on a good hash function. B-trees handle ordered data and data on disk better: they keep themselves perfectly balanced and...