Lecture 5: Gusfield lectures about counting the number of inversions in a permutation. He introduces fast integer multiplication by divide and conquer.
See All 30 Episodes of "Algorithm Design and Analysis"