<=< code="">).
insertionSort
is a stable O(n^2) sorting algorithm that is quite efficient
for very small sets (less than around 20 elements). Use an O(n*log(n)) algorithm
for larger sets.
=<>
insertionSort(xs, orderRelation = NULL)
xs
by (defaults to `<=`< code="">).
This relation by should reflexive, antisymetric, and transitive.=`<>
xs
sorted by the order relation orderRelation
.