When you multiply two numbers on the paper, you probably follow the good old [and naive] way. Using Master theorem it is pretty straightforward to show that this algorithm requires O(n²) multiplications. But there’s actually very clever way to speed the things up.