Both algorithms are charged in the same currency, so that the two counters can be compared:
This is a model, not a theorem: it is chosen so that long multiplication costs exactly n2, matching the slide, and so that everything Karatsuba does outside its recursive calls is linear in the operand width. Constant factors in the chart below depend on these choices; the growth rates do not.
x and y in binary (10110101) or in decimal with a
d prefix (d181). n pads both to a common width; Karatsuba's
n = 2k variant rounds it up to a power of two.