Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What complexity are the methods multiply, divide and pow in BigInteger currently? There is no mention of the computational complexity in the documentation (nor anywhere else).
If you look at the code for
BigInteger(provided with JDK), it appears to me thatmultiply(..)has O(n^2) (actually the method ismultiplyToLen(..)). The code for the other methods is a bit more complex, but you can see yourself.Note: this is for Java 6. I assume it won’t differ in Java 7.