विकिपिडिया नं
Flow chart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" (or true) (more accurately the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number ba replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).

गणितकम्प्युतर विज्ञानय् अल्गोरिदम धाःगु उत्तरोतर गुणन याइगु प्रक्रिया ख। अल्गोरिदमयात गुणन, देता सम्प्रेषण, व स्वचालित तर्कय् छ्यलिगु या।