DSA 2024 föreläsning 06 2024-02-07
Thomas Padron-McCarthy · 87:29
This university lecture on algorithms first uses gnuplot to show why only the dominant term matters when comparing growth rates. It then walks through full pseudocode for merge sort, which is always O(n log n) but nee...