@@ -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 | } |
@@ -84,7 +84,7 @@ discard block |
||
84 | 84 | { |
85 | 85 | $resp = []; |
86 | 86 | foreach ($matrix as $row) { |
87 | - $resp[] = $row[$col]; |
|
87 | + $resp[] = $row[$col]; |
|
88 | 88 | } |
89 | 89 | return $resp; |
90 | 90 | } |
@@ -127,9 +127,9 @@ discard block |
||
127 | 127 | } |
128 | 128 | for ($i=0; $i<$n1; $i++) { |
129 | 129 | for ($j=0; $j<$m2; $j++) { |
130 | - for ($k=0; $k<$n2; $k++) { |
|
131 | - $result[$i][$j] += $matrix1[$i][$k]*$matrix2[$k][$j]; |
|
132 | - } |
|
130 | + for ($k=0; $k<$n2; $k++) { |
|
131 | + $result[$i][$j] += $matrix1[$i][$k]*$matrix2[$k][$j]; |
|
132 | + } |
|
133 | 133 | } |
134 | 134 | } |
135 | 135 | return $result; |