DSA 2024 föreläsning 05 2024-02-02
Thomas Padron-McCarthy · 86:20
This lecture uses logarithms to show why repeatedly halving a problem works so well. Binary search finds an item in about 38 steps among roughly 384 billion sorted numbers, and merge sort uses the same divide-and-conq...