Anonymous user
Talk:Closest-pair problem: Difference between revisions
→About this task: corrected the link, plus stressed the update of the pseudocode
(→About this task: corrected the link, plus stressed the update of the pseudocode) |
|||
Line 16:
: I've updated the pseudocode to explicitly ''store'' the closest pair; however, after updating I thought after all it was not so useful: since a distance is always computed between two points, the information could be considered as ''hidden'' inside the computed distance... However now the implementors are suggested to give that information too... --[[User:ShinTakezou|ShinTakezou]] 18:09, 11 May 2009 (UTC)
::I found
:::C and Perl and also Smalltalk (updated), based now on the '''new''' pseudocode, '''work''', so I suppose the algorithm now is correct! (What written before referred to the previous pseudocode and first Smalltalk implementation) --[[User:ShinTakezou|ShinTakezou]] 09:09, 12 May 2009 (UTC)
==Comment on Algorithms Given==
|