s across the elements is unspecified.

     LST is not modified, but the return might share a common tail with
     LST.

     In the worst case, this is an O(N^2) algorithm because it must
     check each element against all those preceding it.  For long lists
     it is more efficient to sort and then compare only adjacent
     elements.

