Talk:Sorting algorithms/Tree sort on a linked list: Difference between revisions

Talk:Sorting algorithms/Tree sort on a linked list (view source)

751 bytes added , 6 years ago

added a section header to discussion so far ..., added another discussion section header.

Anonymous user

Revision as of 11:54, 11 May 2014 (view source) rosettacode>Paddy3118 (Seconded.) ← Older edit		Revision as of 21:39, 30 October 2017 (view source) rosettacode>Gerard Schildberger (added a section header to discussion so far ..., added another discussion section header.) Newer edit →
Line 1: ==I don't understand this task== I don't understand this task. Tree sort traditionally means loading the elements into a (new) binary search tree data structure, and then reading the elements back out. I don't understand what it means to "tree sort them inplace" in a linked list. --[[User:Spoon!\|Spoon!]] ([[User talk:Spoon!\|talk]]) 03:08, 4 April 2014 (UTC) Line 6 ⟶ 7: :Seconded. --[[User:Paddy3118\|Paddy3118]] ([[User talk:Paddy3118\|talk]]) 11:54, 11 May 2014 (UTC) :Thirded.   -- [[User:Gerard Schildberger\|Gerard Schildberger]] ([[User talk:Gerard Schildberger\|talk]]) 21:39, 30 October 2017 (UTC) ==why must the input be so hard to retrieve?== Couldn't the author of this task download the whole she-bang (the complete text) and uploaded to just one file on Rosetta Code?   That would make it a lot simplier than to have each programmer (code writer) to go through all the work of downloading each of the four books and multiple chapters.   This is, I hope, a task to show a tree sort on a linked list, not a scavenger hunt (or quest).   -- [[User:Gerard Schildberger\|Gerard Schildberger]] ([[User talk:Gerard Schildberger\|talk]]) 21:39, 30 October 2017 (UTC)