Calculate the maximum number of two numbers.

Source: Internet
Author: User
/// <Summary>
/// Calculate the maximum number of two numbers. For example, the maximum value of 42 30 is 6.
/// Method for Finding the maximum common divisor: calculate the maximum common divisor for two numbers. You can use the moving phase division.
/// Always use a large number to divide by a decimal number, and then use the remainder to replace a large number. The divisor is the maximum common divisor. Euclidean Algorithm
/// </Summary>
/// <Param name = "param1"> </param>
/// <Param name = "param2"> </param>
/// <Returns> </returns>
Static int commondivisor (int x, int y)
{
If (x> Y)
{
If (y = 0)
{
Return X;
}

Return commondivisor (Y, X % Y );
}
Else if (x = y)
{
Return X;
}
Else
{
Return commondivisor (X, Y % x );
}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.