Originally posted by SallyAnne
View Post
BTW, you can multiply two numbers of size n (upper bound on both) in O(n.log(n)) by using a fast Fourier transform
P.S. What does "get a word" mean?
Comment