Summary

Strand Sort works by repeatedly extracting sorted sub-lists (strands) from the unsorted input and merging them into a final sorted result. It is most efficient when the data is already partially sorted, as it can identify long existing runs of order.

How it Works

• Create an empty output list.

• While the input list is not empty, create a temporary strand list.

• Move the first item of the input to the strand.

• Traverse the remaining input list. If an item is greater than the last item of the strand, move it from input to strand.

• Merge the now sorted strand into the output list.

• Repeat until the input list is empty.