== European ride algorithm ==
1. If A = 0, D: = B, jump to step 9; 2. If b = 0, D: = A, jump to step 9; 3. If a == stein algorithm == 1. If A = 0, D: = B, jump to step 12; 2. If b = 0, D: = A, jump to step 12; 3. Order positive integer P: = 0; 4. If A and B are even, A: = A / 2, B: = B / 2, P: = P 1; 5. If A and B are still even, they jump to step 4; 6. If A is an even number, B is an odd number, then A: = A / 2; 7. If a is still even, jump to step 6; 8. If a is an odd number, B is even, then B: = B / 2 If b is still even, jump to the 8th; 10. If A and B are not even, then A: = B, B: = | AB |; 11. If B <> 0, jump Step 4; 12.D: = a * Exp (2, p); 13. End. Typically, in the face of general conditions, the Ou Sri Germany can be used, which is due to its historic, more readable and easy to communicate; at the same time, its efficiency is superior to the Stein algorithm. When the large number of operation is facing, the stein algorithm is undoubtedly the best choice.
