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 17:12, 19 March 2019
, 5 years agoReplied to Petelomax's comment about amending task description.
(Phix v2 added) |
(Replied to Petelomax's comment about amending task description.) |
||
Line 11:
Then traverse the tree, in order, and recreate a doubly linked list, again in situ, but of course now in sorted order.
:: In the process, removing all references to Finnegans wake. Phix version 2 now assumes that, and I made that edit. —[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 08:15, 5 November 2018 (UTC)
::: The revised task description seems sensible to me so I've removed the sentence about "not adding to the task" and added a Go entry on the above lines. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 17:11, 19 March 2019 (UTC)
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)
| |||