phpOMS/Algorithm/Sort/CycleSort.php
2024-03-20 07:21:26 +00:00

97 lines
2.0 KiB
PHP
Executable File

<?php
/**
* Jingga
*
* PHP Version 8.2
*
* @package phpOMS\Algorithm\Sort;
* @copyright Dennis Eichhorn
* @license OMS License 2.0
* @version 1.0.0
* @link https://jingga.app
*/
declare(strict_types=1);
namespace phpOMS\Algorithm\Sort;
/**
* CycleSort class.
*
* @package phpOMS\Algorithm\Sort;
* @license OMS License 2.0
* @link https://jingga.app
* @since 1.0.0
*/
final class CycleSort implements SortInterface
{
/**
* Constructor
*
* @since 1.0.0
* @codeCoverageIgnore
*/
private function __construct()
{
}
/**
* {@inheritdoc}
*/
public static function sort(array $list, int $order = SortOrder::ASC) : array
{
$n = \count($list);
if ($n < 2) {
return $list;
}
for ($start = 0; $start < $n - 1; ++$start) {
$item = $list[$start];
$pos = $start;
$length0 = \count($list);
for ($i = $start + 1; $i < $length0; ++$i) {
if (!$list[$i]->compare($item, $order)) {
++$pos;
}
}
if ($pos === $start) {
continue;
}
while ($item->equals($list[$pos])) {
++$pos;
}
if ($pos !== $start) {
$old = $list[$pos];
$list[$pos] = $item;
$item = $old;
}
while ($pos !== $start) {
$pos = $start;
for ($i = $start + 1; $i < $n; ++$i) {
if (!$list[$i]->compare($item, $order)) {
++$pos;
}
}
while (isset($list[$pos]) && $item->equals($list[$pos])) {
++$pos;
}
if (isset($list[$pos])) {
$old = $list[$pos];
$list[$pos] = $item;
$item = $old;
}
}
}
return $list;
}
}