You're replying to a comment by William.

William Permalink
May 26, 2011, 04:08

Actually, the «O(log n)» algorithm is not O(n log n) but O(n^a) where a single call is also O(n^a). If you use naïve long multiplication, a is 2; if you use Karatsuba multiplication, a is log(3)/log(2), which is better.

Reply To This Comment

(why do I need your e-mail?)

(Your twitter handle, if you have one.)

Type the word "linux_147": (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.