Strand Sort

Strand sort is a recursive sorting algorithm that sorts a list into increasing order by repeatedly moving the first element of the remaining list into a new sub-list and then comparing the last element of that sub-list against each subsequent element of the original list, moving over any element greater than the sub-list's last element, until the sub-list can absorb no more elements and is merged into a growing sorted output; the process repeats until all elements are sorted. It has a worst-case time complexity of O(n squared), occurring when the input list is reverse sorted, and a best case of O(n) when the input is already sorted, and its name reflects the strands of already-sorted elements it removes from the unsorted remainder one at a time.