Timsort is a hybrid stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. Details

import "github.com/mimol91/timsort"

elementsToSort := int[]{1,6,2}
sorted := Timsort.Sort[int](elementsToSort)