Sorting algorithms/Patience sort: Difference between revisions
m
→{{header|Icon}}
Line 1,536:
# This need not be a fast implementation. Also, it need not return
# any value less than 2; a single list requires no
i := 2
while i < n do i +:= i
| |||