@@ -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; |
@@ -92,12 +92,12 @@ |
||
92 | 92 | * @param |
93 | 93 | */ |
94 | 94 | function eclideanDistance($p1, $p2) { |
95 | - $len = count($p1); |
|
96 | - $acum = 0; |
|
97 | - for($i=0; $i<$len; $i++) { |
|
98 | - $acum += ($p1[$i] - $p2[$i])**2; |
|
99 | - } |
|
100 | - return sqrt($acum); |
|
95 | + $len = count($p1); |
|
96 | + $acum = 0; |
|
97 | + for($i=0; $i<$len; $i++) { |
|
98 | + $acum += ($p1[$i] - $p2[$i])**2; |
|
99 | + } |
|
100 | + return sqrt($acum); |
|
101 | 101 | } |
102 | 102 | |
103 | 103 | } |