Talk:Closest-pair problem/C: Difference between revisions

Talk:Closest-pair problem/C (view source)

170 bytes added , 12 years ago

Anonymous user

Revision as of 22:56, 17 June 2011 (view source) rosettacode>Ledrug (→‎Propose replacing code: retracted) ← Older edit		Latest revision as of 03:35, 20 June 2011 (view source) rosettacode>Ledrug (→‎Propose replacing code)
(2 intermediate revisions by 2 users not shown)
Line 9: 2. It's shorter and quite a bit faster; 3. It's cleaner IMO. <snip: code removed from talk> --[[User:Ledrug\|Ledrug]] 2103:34, 1718 June 2011 (UTC)▼ ~~<code snipped, needs more thinking>~~ ▲--[[User:Ledrug\|Ledrug]] 21:34, 17 June 2011 (UTC) I am not in love with my own code, expecially when it does not work properly!:D Go replace it, if this one works (I am going to test it, but I trust it works)! (Note: there's no explicit "segfault with 200,000 points or more"... I'll keep my code so a day maybe I'll know why this happens:D) --[[User:ShinTakezou\|ShinTakezou]] 14:54, 18 June 2011 (UTC) ~~: Actually, never mind--the wiki algorithm is bunk if implemented at face value, it fails miserably in some pathological cases. --[[User:Ledrug\|Ledrug]] 22:56, 17 June 2011 (UTC)~~