Strand sort

Strand sort is a very simple recursive sorting algorithm that sorts items of a list into increasing order. It works by moving the first element of a list into a sub-list. Then comparing each subsequent element in the sub-list to the original list and moving each element in the original list that is greater than the element in the sub-list to the sub-list. Then the sub-list is merged into a new list. Repeat this process and merge all sub-lists until all elements are sorted. This algorithm is called strand sort because there are strands of sorted elements within the unsorted elements that are removed one at a time. This algorithm is also comparison sorting algorithm because elements of the sub-list are compared to elements of the original list.  This algorithm is also used in J Sort for fewer than 40 elements. Strand sort has a worst case time complexity of O(n²) which occurs when the input list is reverse sorted. Where n represents the total number of elements being sorted. Strand sort has a best case time complexity of O(n) which occurs when the input is a list that is already sorted. Its average case complexity is O(n log n). Compared to other sorting algorithms, strand sort is on the slower side.Strand sort is stable due to the fact that the relative order of the elements of the same value does not change. Strand sort is not in-place because it’s space complexity is O(n).