Sorting algorithms

algorithm that puts elements of a list in a certain order

non-comparative sorting algorithm

sorting algorithm

Sorting algorithm

an ordering of the vertices of the directed graph for which each edge is directed from earlier to later in the ordering

Sorting refers to ordering data in an increasing or decreasing manner according to some linear relationship among the data items. ordering: arranging items in a sequence ordered by some criterion; categorizing: grouping items with similar properties. Ordering items is the combination of categorizing them based on equivalent order, and ordering the categories themselves.

standard UNIX utility

mathematics problem

sorting algorithm

class of sorting algorithms that can handle massive amounts of data

in discrete mathematics, a pair of positions in a sequence where two elements are out of sorted order

natural sorting algorithm

abstract network that sorts a fixed number of values, made of wires carrying values and comparators connecting pairs of wires, swapping wrongly ordered pairs of values

disk-scheduling algorithm

sorting algorithm

binary tree derived from a sequence of numbers

sorting algorithm that builds a binary search tree and then traverses the tree

recursive sorting algorithm with O(𝑛²) time complexity

algorithm that combines multiple sorted lists into one

linear-time, analog algorithm for sorting a sequence of items

sorting algorithm which exploits existing order in its input

algorithm to sort data of an arbitrary number of dimensions into series of sets by recursively cutting each set of data at the median point along the longest dimension

Slowsort is a sorting algorithm. It is of humorous nature and not useful. It is a reluctant algorithm based on the principle of multiply and surrender (a parody formed by taking the opposites of divide and conquer). It was published in 1984 by Andrei Broder and Jorge Stolfi in their paper "Pessimal Algorithms and Simplexity Analysis" (a parody of optimal algorithms and complexity analysis).

algorithmic problem of sorting a collection of data values by numeric keys, each of which is an integer

programming idiom for efficiently sorting a list by a computed key

programming problem proposed by Edsger Dijkstra

construction of sorting networks of size O(𝑛(log 𝑛)²) and depth O((log 𝑛)²)