请教二维数组矩阵算法

$ary = array(	'a'=>array('a1','a2'),	'b'=>array('b1','b2'),	'c'=>array('c1','c2'),);

回复讨论(解决方案)

echo '';foreach($ary['a'] as $aV){	foreach($ary['b'] as $bV){		foreach($ary['c'] as $cV){			echo "";		}	}}echo '
$aV
$bV
$cV
';

echo '';foreach($ary['a'] as $aV){	foreach($ary['b'] as $bV){		foreach($ary['c'] as $cV){			echo "";		}	}}echo '
$aV
$bV
$cV
';

$ary = array(    'a'=>array('a1','a2'),    'b'=>array('b1','b2'),    'c'=>array('c1','c2'),);echo "\n";echo "\n";foreach($ary['a'] as $m) {  foreach($ary['b'] as $n) {    foreach($ary['c'] as $v) {      echo "\n";    }  }}echo "
a
b
c
$m
$n
$v
";

精华区有 求笛卡尔积 的代码

精华区有 求笛卡尔积 的代码

$ary = array(    'a'=>array('a1','a2'),    'b'=>array('b1','b2'),    'c'=>array('c1','c2'),	'd'=>array('d1','d2'),	'e'=>array('e1','e2'),	//..........多行......);

精华区 迪尔卡积 我问的问题....前后几篇 很完整了