I have a problem with programming a Lehmer's gcd algorithm. It works fine but the problem is that it's slower than the basic euclidean algorithm. Can anyone tell me where is the problem....
|CodeGuru Home||VC++ / MFC / C++||.NET / C#||Visual Basic||VB Forums||Developer.com|
Type: Posts; User: mirjamkolar
Search: Search took 0.02 seconds.
Results 1 to 1 of 1
Click Here to Expand Forum to Full Width
This is a CodeGuru survey question.