Sorting Algorithm

A named algorithm whose defined job is arranging the elements of a collection into an order, filed here regardless of the technique it uses internally. Belongs here: Introsort and Timsort, each a complete, named sorting procedure with a known running time. Does not belong here: a general searching or comparison technique used inside a sort but not itself a full sorting procedure, filed under the technique-holding concept type instead, and an algorithm that only orders a small internal step of a larger, differently named procedure.