Function sort

sort<T>(list: LinkedList<T>): LinkedList<T>
Returns a new list with the elements in the provided list in order. The default sort order is ascending, built upon converting the elements into strings.

The function implements the merge sort algorithm, with O(n log n) time complexity and O(n) space complexity.

sort() attempts to replicate the specified behaviour of the Array.prototype.sort() method (although bear in mind that Array.prototype.sort() is not stable in every environment).
Type Parameters
- T
Parameters
- list: LinkedList<T>
  Linked list.
Returns LinkedList<T>
A new sorted list.
Example
```
import { listOf, sort } from '@pacote/linked-list'

sort(listOf(3, 2, 1)) // => [1, [2, [3, undefined]]]
```
- Defined in sort.ts:83
sort<T>(compare: CompareFn<T>, list: LinkedList<T>): LinkedList<T>
Returns a new list with the elements in the provided list in order. The sort order is determined by a custom comparator function.

The function implements the merge sort algorithm, with O(n log n) time complexity and O(n) space complexity.

sort() attempts to replicate the specified behaviour of the Array.prototype.sort() method (although bear in mind that Array.prototype.sort() is not stable in every environment).
Type Parameters
- T
Parameters
- compare: CompareFn<T>
  Comparator function.
- list: LinkedList<T>
  Linked list.
Returns LinkedList<T>
A new sorted list.
- Defined in sort.ts:103