Sorting algorithms/Tree sort on a linked list: Difference between revisions
Sorting algorithms/Tree sort on a linked list (view source)
Revision as of 18:01, 6 July 2022
, 1 year ago→{{header|ATS}}
m (→{{header|ATS}}) |
m (→{{header|ATS}}) |
||
Line 571:
I see the task used to have something to do with Finnegan's Wake, and with counting cycles, etc. Here I simply sort a list of integers.
It is unlikely, in ATS, that someone would use doubly-linked lists as their canonical linked list implementation.
(Obviously, if sorting a ''non-linear'' linked list, it is in general necessary to allocate new nodes. However, it is not necessary to allocate any ''temporary'' nodes.)
=={{header|C}}==
| |||