PHP 函數式程式設計與設計模式

<?php

interface SortStrategy
{
    public function sort(array $data): array;
}

class BubbleSortStrategy implements SortStrategy
{
    public function sort(array $data): array
    {
        for ($i = 0; $i < count($data); $i++) {
            for ($j = $i + 1; $j < count($data); $j++) {
                if ($data[$i] > $data[$j]) {
                    $temp = $data[$i];
                    $data[$i] = $data[$j];
                    $data[$j] = $temp;
                }
            }
        }
        return $data;
    }
}

class QuickSortStrategy implements SortStrategy
{
    public function sort(array $data): array
    {
        if (count($data) <= 1) {
            return $data;
        }

        $pivot = $data[0];
        $left = [];
        $right = [];

        for ($i = 1; $i < count($data); $i++) {
            if ($data[$i] < $pivot) {
                $left[] = $data[$i];
            } else {
                $right[] = $data[$i];
            }
        }

        return array_merge($this->sort($left), [$pivot], $this->sort($right));
    }
}


$data = [5, 3, 1, 2, 4];

$bubbleSortStrategy = new BubbleSortStrategy();
$sortedData = array_map(function ($value) use ($bubbleSortStrategy) {
    return $bubbleSortStrategy->sort($value);
}, [$data]);

echo implode(', ', $sortedData[0]); // Output: 1, 2, 3, 4, 5


$quickSortStrategy = new QuickSortStrategy();
$sortedData = array_map(function ($value) use ($quickSortStrategy) {
    return $quickSortStrategy->sort($value);
}, [$data]);

echo implode(', ', $sortedData[0]); // Output: 1, 2, 3, 4, 5