Closest-pair problem: Difference between revisions
Content added Content deleted
m (fix Swift version) |
No edit summary |
||
Line 1,617: | Line 1,617: | ||
return (p2.x-p1.x)^2 + (p2.y-p1.y)^2 # (sufficient for closeness) |
return (p2.x-p1.x)^2 + (p2.y-p1.y)^2 # (sufficient for closeness) |
||
end</lang> |
end</lang> |
||
=={{header|IS-BASIC}}== |
|||
<lang IS-BASIC>100 PROGRAM "Closestp.bas" |
|||
110 NUMERIC X(1 TO 10),Y(1 TO 10) |
|||
120 FOR I=1 TO 10 |
|||
130 READ X(I),Y(I) |
|||
140 PRINT X(I),Y(I) |
|||
150 NEXT |
|||
160 LET MN=INF |
|||
170 FOR I=1 TO 9 |
|||
180 FOR J=I+1 TO 10 |
|||
190 LET DSQ=(X(I)-X(J))^2+(Y(I)-Y(J))^2 |
|||
200 IF DSQ<MN THEN LET MN=DSQ:LET MINI=I:LET MINJ=J |
|||
210 NEXT |
|||
220 NEXT |
|||
230 PRINT "Closest pair is (";X(MINI);",";Y(MINI);") and (";X(MINJ);",";Y(MINJ);")":PRINT "at distance";SQR(MN) |
|||
240 DATA 0.654682,0.925557 |
|||
250 DATA 0.409382,0.619391 |
|||
260 DATA 0.891663,0.888594 |
|||
270 DATA 0.716629,0.996200 |
|||
280 DATA 0.477721,0.946355 |
|||
290 DATA 0.925092,0.818220 |
|||
300 DATA 0.624291,0.142924 |
|||
310 DATA 0.211332,0.221507 |
|||
320 DATA 0.293786,0.691701 |
|||
330 DATA 0.839186,0.728260</lang> |
|||
=={{header|J}}== |
=={{header|J}}== |