Greatest Common Divisor

The greatest common divisor of two positive integers can be found by recursively dividing the larger number by the smaller number until the remainder is 0.

Problem

Find the greatest common divisor of two positive integers.
Example input:
15 and 25
Example output:
5

Solution

This solution is in C#. Our A.I. can create solutions in multiple languages.
by kayakane 
using System;

namespace InterviewPreperationGuide.Core.CrackingTheCodingInterview.c16q1 {
    public class Solution {
        public void Init () {
            Console.WriteLine ();
        }
    }
}
A.I. Evaluation of the Solution

The candidate's solution does not demonstrate a level of completeness and does not solve the problem. The general approach is not clear.

Evaluated at: 2022-11-30 00:15:30