How can PHP be used to determine the cheapest combination of product IDs based on product groups and prices?

To determine the cheapest combination of product IDs based on product groups and prices in PHP, you can use a recursive function to iterate through all possible combinations and calculate the total price for each combination. Then, compare the total prices and keep track of the combination with the lowest price. 

<?php

function findCheapestCombination($productGroups, $currentCombination = [], $currentIndex = 0, $currentPrice = 0, &$cheapestCombination = [], &$cheapestPrice = PHP_INT_MAX) {
    if ($currentIndex == count($productGroups)) {
        if ($currentPrice < $cheapestPrice) {
            $cheapestCombination = $currentCombination;
            $cheapestPrice = $currentPrice;
        }
        return;
    }

    foreach ($productGroups[$currentIndex] as $productId => $price) {
        $currentCombination[$currentIndex] = $productId;
        findCheapestCombination($productGroups, $currentCombination, $currentIndex + 1, $currentPrice + $price, $cheapestCombination, $cheapestPrice);
    }
}

$productGroups = [
    [1 => 10, 2 => 15], // Group 1
    [3 => 20, 4 => 25], // Group 2
    [5 => 30, 6 => 35] // Group 3
];

$cheapestCombination = [];
$cheapestPrice = PHP_INT_MAX;

findCheapestCombination($productGroups, [], 0, 0, $cheapestCombination, $cheapestPrice);

echo "Cheapest Combination: " . implode(', ', $cheapestCombination) . "\n";
echo "Total Price: " . $cheapestPrice . "\n";

?>

Keywords

PHP product IDs product groups prices combination cheapest

Related Questions