Help for this page

Select Code to Download


  1. or download this
      m[i,i] = 0
      m[i,j] =  min  { m[i,k] + m[k+1,j] + p[i-1]*p[k]*p[j] }
               i<=k<j
    
  2. or download this
    use Memoize;
    use List::Util 'min';
    ...
        return min map { m($i,$_) + m($_+1,$j) + $P[$i-1]*$P[$_]*$P[$j] }
                   $i .. $j-1;
    }