Stanford CS161 Lecture 1: Why Algorithm Analysis Starts with Karatsuba Multiplication
Splitting two n-digit integers in half still creates four recursive products and leaves the runtime at n². Karatsuba reconstructs the cross term with (a+b)(c+d)-ac-bd, cuts the branching factor to three, and reaches roughly n^1.585.