LinkedList.sort

Uses a merge-sort-based algorithm.

Time complexity: O(n log n)

class LinkedList(V, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
final
sort
()

Meta