Algorithm
A simple way to express strand sort in pseudocode is as follows:
procedure strandSort( A : list of sortable items ) defined as: while length( A ) > 0 clear sublist sublist := A remove A for each i in 0 to length( A ) - 1 do: if A > sublist then append A to sublist remove A end if end for merge sublist into results end while return results
end procedure
Read more about this topic: Strand Sort