completeSort

void completeSort(alias  less =  "a < b",  SwapStrategy ss =  SwapStrategy.unstable,
         Lhs ,  Rhs)(SortedRange!(Lhs,  less)  lhs,  Rhs rhs) if (hasLength!(Rhs)  &&  hasSlicing!(Rhs)
         &&  hasSwappableElements!Lhs &&  hasSwappableElements!Rhs)

Sorts the random-access range chain(lhs, rhs) according to predicate less.

The left-hand side of the range lhs is assumed to be already sorted; rhs is assumed to be unsorted. The exact strategy chosen depends on the relative sizes of lhs and rhs. Performs lhs.length + rhs.length * log(rhs.length) (best case) to (lhs.length + rhs.length) * log(lhs.length + rhs.length) (worst-case) evaluations of swap.

Parameters

`less`	The predicate to sort by.
`ss`	The swapping strategy to use.
`lhs`	The sorted, left-hand side of the random access range to be sorted.
`rhs`	The unsorted, right-hand side of the random access range to be sorted.