mirror of
https://github.com/Karaka-Management/phpOMS.git
synced 2026-01-12 02:08:40 +00:00
119 lines
2.5 KiB
PHP
119 lines
2.5 KiB
PHP
<?php
|
|
/**
|
|
* Orange Management
|
|
*
|
|
* PHP Version 7.0
|
|
*
|
|
* @category TBD
|
|
* @package TBD
|
|
* @author OMS Development Team <dev@oms.com>
|
|
* @author Dennis Eichhorn <d.eichhorn@oms.com>
|
|
* @copyright 2013 Dennis Eichhorn
|
|
* @license OMS License 1.0
|
|
* @version 1.0.0
|
|
* @link http://orange-management.com
|
|
*/
|
|
|
|
namespace phpOMS\Math;
|
|
|
|
/**
|
|
* Well known functions class.
|
|
*
|
|
* @category Framework
|
|
* @package phpOMS\DataStorage\Database
|
|
* @author OMS Development Team <dev@oms.com>
|
|
* @author Dennis Eichhorn <d.eichhorn@oms.com>
|
|
* @license OMS License 1.0
|
|
* @link http://orange-management.com
|
|
* @since 1.0.0
|
|
*/
|
|
class Functions
|
|
{
|
|
/**
|
|
* Calculate gammar function value.
|
|
*
|
|
* Example: (7)
|
|
*
|
|
* @param int $k Variable
|
|
*
|
|
* @return int
|
|
*
|
|
* @since 1.0.0
|
|
* @author Dennis Eichhorn <d.eichhorn@oms.com>
|
|
*/
|
|
public static function getGammaInteger(\int $k) : \int
|
|
{
|
|
return self::fact($k - 1);
|
|
}
|
|
|
|
/**
|
|
* Calculate gammar function value.
|
|
*
|
|
* Example: (7, 2)
|
|
*
|
|
* @param int $n Factorial upper bound
|
|
* @param int $start Factorial starting value
|
|
*
|
|
* @return int
|
|
*
|
|
* @since 1.0.0
|
|
* @author Dennis Eichhorn <d.eichhorn@oms.com>
|
|
*/
|
|
public static function fact(\int $n, \int $start = 1) : \int
|
|
{
|
|
$fact = 1;
|
|
|
|
for ($i = $start; $i < $n + 1; $i++) {
|
|
$fact *= $i;
|
|
}
|
|
|
|
return $fact;
|
|
}
|
|
|
|
/**
|
|
* Calculate binomial coefficient
|
|
*
|
|
* Algorithm optimized for large factorials without the use of big int or string manipulation.
|
|
*
|
|
* Example: (7, 2)
|
|
*
|
|
* @param int $n
|
|
* @param int $k
|
|
*
|
|
* @return int
|
|
*
|
|
* @since 1.0.0
|
|
* @author Dennis Eichhorn <d.eichhorn@oms.com>
|
|
*/
|
|
public static function binomialCoefficient(\int $n, \int $k) : \int
|
|
{
|
|
$max = max([$k, $n - $k]);
|
|
$min = min([$k, $n - $k]);
|
|
|
|
$fact = 1;
|
|
$range = array_reverse(range(1, $min));
|
|
|
|
for ($i = $max + 1; $i < $n + 1; $i++) {
|
|
$div = 1;
|
|
foreach ($range as $key => $d) {
|
|
if ($i % $d === 0) {
|
|
$div = $d;
|
|
|
|
unset($range[$key]);
|
|
break;
|
|
}
|
|
}
|
|
|
|
$fact *= $i / $div;
|
|
}
|
|
|
|
$fact2 = 1;
|
|
|
|
foreach ($range as $d) {
|
|
$fact2 *= $d;
|
|
}
|
|
|
|
return $fact / $fact2;
|
|
}
|
|
}
|