tree 1a9358558c02fcbd2fac78bfe64797a3ea15f240
parent a05bdf0f2eb334899d16ef4b1766b1c5e4a63699
author Wan-Teh Chang <wtc@google.com> 1663990110 -0700
committer Wan-Teh Chang <wtc@google.com> 1664212886 -0700

Replace repeated subtraction by modulo in calcGCD

calcGCD uses repeated subtraction as in the original Euclid's algorithm.
But repeated subtraction takes a long time for inputs such as
calcGCD(1937072755, 1) and calcGCD(1937073715, 1).

Bug: b/246649620