Closest-pair problem: Difference between revisions
Content added Content deleted
No edit summary |
(Closest-pair problem en BASIC256) |
||
Line 324: | Line 324: | ||
<pre> |
<pre> |
||
distance between (0.891663,0.888594) and (0.925092,0.818220) is 0.0779102 |
distance between (0.891663,0.888594) and (0.925092,0.818220) is 0.0779102 |
||
</pre> |
|||
=={{header|BASIC256}}== |
|||
'''Versión de fuerza bruta: |
|||
<lang BASIC256> |
|||
Dim x(9) |
|||
x = {0.654682, 0.409382, 0.891663, 0.716629, 0.477721, 0.925092, 0.624291, 0.211332, 0.293786, 0.839186} |
|||
Dim y(9) |
|||
y = {0.925557, 0.619391, 0.888594, 0.996200, 0.946355, 0.818220, 0.142924, 0.221507, 0.691701, 0.728260} |
|||
minDist = 1^30 |
|||
For i = 0 To 8 |
|||
For j = i+1 To 9 |
|||
dist = (x[i] - x[j])^2 + (y[i] - y[j])^2 |
|||
If dist < minDist Then minDist = dist : minDisti = i : minDistj = j |
|||
Next j |
|||
Next i |
|||
Print "El par más cercano es "; minDisti; " y "; minDistj; " a una distancia de "; Sqr(minDist) |
|||
End |
|||
</lang> |
|||
{{out}} |
|||
<pre> |
|||
El par más cercano es 2 y 5 a una distancia de 0,077910191355 |
|||
</pre> |
</pre> |
||