algorithms.pdqsort
¶
Source code: algorithms/pdqsort.seq
- algorithms.pdqsort.INSERTION_SORT_THRESHOLD¶
- algorithms.pdqsort.NINTHER_THRESHOLD¶
- algorithms.pdqsort.PARTIAL_INSERTION_SORT_LIMIT¶
- algorithms.pdqsort.pdq_sort_array[S, T](collection: Array[T], size: int, keyf: Callable[T, S])¶
Pattern-defeating Quicksort By Orson Peters, published at https://github.com/orlp/pdqsort
Sorts the array inplace.
- algorithms.pdqsort.pdq_sort_inplace[S, T](collection: List[T], keyf: Callable[T, S])¶
Pattern-defeating Quicksort By Orson Peters, published at https://github.com/orlp/pdqsort
Sorts the list inplace.
- algorithms.pdqsort.pdq_sort[S, T](collection: List[T], keyf: Callable[T, S])¶
Pattern-defeating Quicksort By Orson Peters, published at https://github.com/orlp/pdqsort
Returns a sorted list.