What is the fastest way to multiply, divide ,add and subtract two numbers . Here I am asking answer on bit level like boothe’s multiplications ,etc.

please provide algo also if possible.

Thanks!

Fastest depends on size of input numbers. FFT multplication runs in O(nlogn) while karatsuba runs in O(n^(1.5)) correct me if im wrong. But karatsuba would perform faster on relatively small numbers despite having greater order of growth because FFT mul has large coefficients.

1 Like