@@ -91,9 +91,9 @@ |
||
| 91 | 91 | } |
| 92 | 92 | for ($i=0; $i<$n1; $i++) { |
| 93 | 93 | for ($j=0; $j<$m2; $j++) { |
| 94 | - for ($k=0; $k<$n2; $k++) { |
|
| 95 | - $result[$i][$j] += $matrix1[$i][$k]*$matrix2[$k][$j]; |
|
| 96 | - } |
|
| 94 | + for ($k=0; $k<$n2; $k++) { |
|
| 95 | + $result[$i][$j] += $matrix1[$i][$k]*$matrix2[$k][$j]; |
|
| 96 | + } |
|
| 97 | 97 | } |
| 98 | 98 | } |
| 99 | 99 | return $result; |
@@ -122,12 +122,12 @@ |
||
| 122 | 122 | * @param |
| 123 | 123 | */ |
| 124 | 124 | public static function eclideanDistance($p1, $p2) { |
| 125 | - $len = count($p1); |
|
| 126 | - $acum = 0; |
|
| 127 | - for($i=0; $i<$len; $i++) { |
|
| 128 | - $acum += ($p1[$i] - $p2[$i])**2; |
|
| 129 | - } |
|
| 130 | - return sqrt($acum); |
|
| 125 | + $len = count($p1); |
|
| 126 | + $acum = 0; |
|
| 127 | + for($i=0; $i<$len; $i++) { |
|
| 128 | + $acum += ($p1[$i] - $p2[$i])**2; |
|
| 129 | + } |
|
| 130 | + return sqrt($acum); |
|
| 131 | 131 | } |
| 132 | 132 | |
| 133 | 133 | } |