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 21:44, 5 November 2018
, 5 years agoPhix v2 added
(Phix v2 added) |
|||
Line 5:
: —[[User:dchapes|dchapes]] ([[User talk:dchapes|talk]] | [[Special:Contributions/dchapes|contribs]]) 15:26, 12 July 2018 (UTC)
:: Ah, I knew there was a reason this had appeared on my radar
Task:
First, construct a doubly linked list (unsorted).
Then construct a tree in situ: use the prev and next of that list as left and right tree pointers.
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 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)
| |||