3v4l.org

run code in 300+ PHP versions simultaneously
<? $expectedAmount = 13460.39; $arr = array(1090, 800, 293, 456.35,483.6,5766,1295,424,2005.15,944.5,7100,6800,7100); // Only modify above lines function printCombination($arr, $n, $r, &$result) { $data = array(); // int data[r]; combinationUtil($arr, $data, 0, $n-1, 0 ,$r, $result); } function combinationUtil($arr, $data, $start, $end, $index, $r, &$result) { if ($index == $r) { $tmpArray = array(); for ($i = 0; $i < $r; $i++) { array_push($tmpArray, $data[$i]); // echo $data[$i]; } // echo "<br>"; array_push($result, $tmpArray); return; } for ($i = $start; $i <= $end && $end - $i +1 >= $r - $index; $i++) { $data[$index] = $arr[$i]; combinationUtil($arr, $data, $i+1, $end, $index+1, $r, $result); } } function printValue($arr) { $string = ""; foreach ($arr as $value) { $string .= "$".$value.", "; } echo substr($string, 0, strlen($string)-2); } $result = array(); $n = sizeof($arr)/sizeof($arr[0]); for ($i = 1; $i <= $n; $i++) { printCombination($arr, $n, $i, $result); } $highestAmount = 0; $highestCombination = NULL; foreach ($result as $value) { $tempAmount = 0; foreach ($value as $cost) { $tempAmount += $cost; } if ($tempAmount > $highestAmount && $expectedAmount > $tempAmount) { $highestAmount = $tempAmount; $highestCombination = $value; } } echo "highestAmount: ". $highestAmount."\n"; echo "highestCombination: "; printValue($highestCombination); ?>
Output for git.master, git.master_jit, rfc.property-hooks
<? $expectedAmount = 13460.39; $arr = array(1090, 800, 293, 456.35,483.6,5766,1295,424,2005.15,944.5,7100,6800,7100); // Only modify above lines function printCombination($arr, $n, $r, &$result) { $data = array(); // int data[r]; combinationUtil($arr, $data, 0, $n-1, 0 ,$r, $result); } function combinationUtil($arr, $data, $start, $end, $index, $r, &$result) { if ($index == $r) { $tmpArray = array(); for ($i = 0; $i < $r; $i++) { array_push($tmpArray, $data[$i]); // echo $data[$i]; } // echo "<br>"; array_push($result, $tmpArray); return; } for ($i = $start; $i <= $end && $end - $i +1 >= $r - $index; $i++) { $data[$index] = $arr[$i]; combinationUtil($arr, $data, $i+1, $end, $index+1, $r, $result); } } function printValue($arr) { $string = ""; foreach ($arr as $value) { $string .= "$".$value.", "; } echo substr($string, 0, strlen($string)-2); } $result = array(); $n = sizeof($arr)/sizeof($arr[0]); for ($i = 1; $i <= $n; $i++) { printCombination($arr, $n, $i, $result); } $highestAmount = 0; $highestCombination = NULL; foreach ($result as $value) { $tempAmount = 0; foreach ($value as $cost) { $tempAmount += $cost; } if ($tempAmount > $highestAmount && $expectedAmount > $tempAmount) { $highestAmount = $tempAmount; $highestCombination = $value; } } echo "highestAmount: ". $highestAmount."\n"; echo "highestCombination: "; printValue($highestCombination); ?>

This tab shows result from various feature-branches currently under review by the php developers. Contact me to have additional branches featured.

Active branches

Archived branches

Once feature-branches are merged or declined, they are no longer available. Their functionality (when merged) can be viewed from the main output page

preferences:
44.59 ms | 405 KiB | 8 Q