Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Re: Dixons factorisation implementation issue
Sorry, I know nothing about the algorithm. I can only suggest ways to try to debug the code.help with is to try and minimise this timing lag.
You need to find a forum that deals with math algorithms. This one is for java programming.
For example when I added some print statements I saw that res1 - res4 were never different. They were either always all false or all true.
Is that expected?
When I printed the value of x1 it was the same for hundreds of lines. When should it change?
If you don't understand my answer, don't ignore it, ask a question.
Re: Dixons factorisation implementation issue
Not really an issue with the algorithm though its more the inefficiency of the for loop method.
But if you cant help not to worry, thanks for looking into the issue anyways.
Reply With Quote