About this question
Hard · Algorithms & Data Structures · Quant Trader interview question · algorithms, time-complexity, karatsuba, multiplication
You are tasked with designing a high-frequency trading algorithm that requires multiplying large integers (representing, for example, order sizes or price levels). You need to choose an efficient multiplication algorithm. Consider multiplying two n-digit numbers. What is the time complexity of Karatsuba multiplication compared to the standard schoolbook multiplication algorithm?