Large number multiplication

[Billy Mays]

I was looking through the python source and noticed that long 
multiplication is done using the Karatsuba method (O(~n^1.5)) rather 
than using FFTs O(~n log n).  I was wondering if there was a reason the 
Karatsuba method was chosen over the FFT convolution method?

--
Bill
--
http://mail.python.org/mailman/listinfo/python-list