PHP 配列の多次元ソートの進化: 新世代のソート アルゴリズムの探索

function multi维排序($array, $sortingColumns, $sortOrder = SORT_ASC) {
    $sortedArray = $array;
    $columnsCount = count($sortingColumns);

    for ($i = 0; $i < count($sortedArray); $i++) {
        for ($j = $i + 1; $j < count($sortedArray); $j++) {
            $compareResult = compare($sortedArray[$i], $sortedArray[$j], $sortingColumns, $sortOrder);

            if ($compareResult == -1) {
                swap($sortedArray, $i, $j);
            }
        }
    }

    return $sortedArray;
}

function compare($a, $b, $sortingColumns, $sortOrder) {
    foreach ($sortingColumns as $column) {
        if ($a[$column] == $b[$column]) {
            continue;
        }

        if ($sortOrder == SORT_ASC) {
            return $a[$column] < $b[$column] ? 1 : -1;
        } else {
            return $a[$column] > $b[$column] ? 1: -1;
        }
    }

    return 0;
}

$array = [
    ['name' => 'John Doe', 'age' => 25],
    ['name' => 'Jane Smith', 'age' => 30],
    ['name' => 'Peter Jones', 'age' => 28]
];

$sortedArray = multi维排序($array, ['age', 'name'], SORT_ASC);

print_r($sortedArray);

[
    ['name' => 'John Doe', 'age' => 25],
    ['name' => 'Peter Jones', 'age' => 28],
    ['name' => 'Jane Smith', 'age' => 30]
]