Library sort or gapped insertion sort is a sorting algorithm that uses an insertion sort, but with gaps in the array to accelerate subsequent insertions...

widely used Timsort dating to 2002, and the library sort being first published in 2006. Comparison sorting algorithms have a fundamental requirement of...

Template Library SORT (journal) Sort (mathematical logic), a domain in a many-sorted structure Sort (typesetting), a piece of metal type Sort, Lleida,...

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons. It is much less efficient...

efficient algorithms such as quicksort, timsort, or merge sort are used by the sorting libraries built into popular programming languages such as Python...

for example, in Unix as the default library sort subroutine. Hence, it lent its name to the C standard library subroutine qsort and in the reference...

science, merge sort (also commonly spelled as mergesort and as merge-sort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most...

sort is a generic function in the C++ Standard Library for doing comparison sorting. The function originated in the Standard Template Library (STL). The...

number of standard library sort functions, including some C++ sort implementations. The June 2000 SGI C++ Standard Template Library stl_algo.h implementation...

shaker sort, also known as bidirectional bubble sort, cocktail sort, shaker sort (which can also refer to a variant of selection sort), ripple sort, shuffle...