Anonymous user
Talk:Closest-pair problem: Difference between revisions
m
→About this task: (corrected the link for real!)
(→About this task: corrected the link, plus stressed the update of the pseudocode) |
m (→About this task: (corrected the link for real!)) |
||
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 [http://www.cs.iupui.edu/~xkzou/teaching/CS580/Divide-and-conquer-closestPair.ppt This reference] helped me with my Python example, which seems to work. --[[User:Paddy3118|Paddy3118]] 21:56, 11 May 2009 (UTC)
:::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)
| |||