Anonymous user
Talk:Sorting algorithms/Tree sort on a linked list: Difference between revisions
Talk:Sorting algorithms/Tree sort on a linked list (view source)
Revision as of 10:55, 11 May 2014
, 10 years agoBah, the task is even worse than that as I look more at it. Delete?
(Benchmarks? Just say no!) |
(Bah, the task is even worse than that as I look more at it. Delete?) |
||
Line 2:
The proposed task talks about performance. This is a Bad Idea because it's next to impossible to compare performance between systems (different CPU speeds, different memory bandwidths, different loading patterns, etc.) Talking about performance strongly encourages people to try to “optimise” their implementations, which tends to make them significantly less readable and less idiomatic. Finally, actually measuring performance fairly and accurately is hard; there are lies, damned lies, and benchmarks. –[[User:Dkf|Donal Fellows]] ([[User talk:Dkf|talk]]) 10:49, 11 May 2014 (UTC)
And the proposed sample text is ridiculously long; there's also no meaningful output. (Just printing some metadata about the supposed performance is insufficient, as it does not check that things are correct. Wrong “solutions” can be incredibly fast.) This whole task needs major revision (and soon!) or I'll have to consider deleting it entirely. –[[User:Dkf|Donal Fellows]] ([[User talk:Dkf|talk]]) 10:55, 11 May 2014 (UTC)
| |||