Talk:Sorting algorithms/Tree sort on a linked list: Difference between revisions
Content added Content deleted
(added a section header to discussion so far ..., added another discussion section header.) |
(→why must the input be so much work to retrieve?: changed the section header name.) |
||
Line 9: | Line 9: | ||
:Thirded. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:39, 30 October 2017 (UTC) |
:Thirded. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:39, 30 October 2017 (UTC) |
||
==why must the input be so |
==why must the input be so much work 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) |
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) |