lion0k/project-lvl1-s384

View on GitHub
src/games/gcd.php

Summary

Maintainability
A
0 mins
Test Coverage
<?php
/**
 * User: li0n0k
 * Date: 28.11.18
 * Time: 10:07
 */

namespace Project1;

function findGcd($number1, $number2)
{
    if ($number1 % $number2) {
        return findGcd($number2, $number1 % $number2);
    } else {
        return $number2;
    }
}

function startGameGcd()
{
    $description = 'Find the greatest common divisor of given numbers.';

    $funcTask = function () {
        $number1 = getRandomNumber();
        $number2 = getRandomNumber();

        $correctAnswer = function () use ($number1, $number2) {
            return findGcd($number1, $number2);
        };

        return ['question' => "{$number1} {$number2}", 'correctAnswer' => $correctAnswer()];
    };

    startPlay($description, $funcTask);
}