core/org.gnit.lucenekmp.util/CollectionUtil/timSort

timSort

fun <T> timSort(list: MutableList<T>, comp: Comparator<T>)

Sorts the given random access List using the Comparator. The list must implement RandomAccess. This method uses the Tim sort algorithm, but falls back to binary sort for small lists.

See also

Throws

if list is e.g. a linked list without random access.

fun <T : Comparable<T>> timSort(list: MutableList<T>)

Sorts the given random access List in natural order. The list must implement [ ]. This method uses the Tim sort algorithm, but falls back to binary sort for small lists.

See also

Throws

if list is e.g. a linked list without random access.

Generated by Dokka
© 2026 Copyright