Function strand_sort

# Strand Sort Strand Sort is a comparison-based sorting algorithm that works by repeatedly extracting increasing subsequences ("strands") from the input and merging them into a growing result list. ## Algorithm 1. Remove the first element of the remaining input and start a new *strand*. 2. Scan the rest of the input left-to-right; whenever an element is ≥ the last element of the strand, pull it

(arr: &mut Vec<T>)