>Digital-flame

In 1983 Computing was anyones' game

Home
Langs
- Delphi
  - Basics
  - Delphi.Masterpiece
  - UniGui
  - FireDAC
  - FireMonkey
  - Indy
  - DataSnap
  - FastReport
- C#
  - Syntax&Basics
  - ADO.NET
  - Entity
  - Algo
  - MVC
  - C#. TelegramCommands
- JS
  - Js. Basics
  - Webpack
  - ExtJS Framework
  - jQuery
  - React
  - TypeScript
  - CSS
  - InterviewTasks
- PHP
- HTML
DB
VersionControl
- Git
- SVN
Algo
- C#
- Other
DesignPatterns
ToLearn
Author
Other
- IDE and other tools
- IIS
Music

← Git commands

С#. Algo. BinarySearch →

C#. Algorithms. Greatest common divisor

Posted on 20.09.2017 by Stanislav_Panteleev

Git

C#

    public static int gcd(int p, int q)
        {
            if (q == 0) return p;
            int r = p % q;
            return gcd(q, r);
        }

1

2

3

4

5

6

public static int gcd(int p, int q)

{

if (q == 0) return p;

int r = p % q;

return gcd(q, r);

}

This entry was posted in C#. Bookmark the permalink.

← Git commands

С#. Algo. BinarySearch →

Search for:
MY PROJECTS
Recent Posts
Categories

>Digital-flame

Proudly powered by WordPress.

C#. Algorithms. Greatest common divisor

MY PROJECTS

Recent Posts

Categories