Sorting algorithms/Tree sort on a linked list: Difference between revisions
Sorting algorithms/Tree sort on a linked list (view source)
Revision as of 17:52, 6 July 2022
, 1 year ago→{{header|ATS}}
m (→{{header|ATS}}) |
|||
Line 569:
Some comments:
I see the task used to have something to do with Finnegan's
It is unlikely, in ATS, that someone would use doubly-linked lists as their canonical linked list implementation. Therefore sorting a singly-linked list this way would be interesting, but I cannot think of a way to do it without allocating new nodes. Of course, a quicksort or mergesort can be done on a singly-linked list without allocating new nodes.
| |||