- Sort Score
- Result 10 results
- Languages All
Results 51 - 51 of 51 for vol7 (0.03 sec)
-
src/math/big/int.go
// lehmerGCD sets z to the greatest common divisor of a and b, // which both must be != 0, and returns z. // If x or y are not nil, their values are set such that z = a*x + b*y. // See Knuth, The Art of Computer Programming, Vol. 2, Section 4.5.2, Algorithm L. // This implementation uses the improved condition by Collins requiring only one // quotient and avoiding the possibility of single Word overflow.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 33.1K bytes - Viewed (0)