science, a nearly-sorted sequence, also known as roughly-sorted sequence and as k {\displaystyle k} -sorted sequence is a sequence which is almost ordered...

information into a standard order K-sorted sequence Schwartzian transform – Programming idiom for efficiently sorting a list by a computed key Search algorithm –...

considered sorted). Repeatedly merge sublists to produce new sorted sublists until there is only one sublist remaining. This will be the sorted list. Example...

typical GPU. A sorted sequence is a monotonically non-decreasing (or non-increasing) sequence. A bitonic sequence is a sequence with x 0 ≤ ⋯ ≤ x k ≥ ⋯ ≥ x n...

already sorted or partly sorted), insertion sort is distinctly more efficient compared to selection sort. On average (assuming the rank of the (k + 1)-st...

computer science, k-way merge algorithms or multiway merges are a specific type of sequence merge algorithms that specialize in taking in k sorted lists and merging...

Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually...

application, a topological ordering is just a valid sequence for the tasks. Precisely, a topological sort is a graph traversal in which each node v is visited...

Spaghetti sort is a linear-time, analog algorithm for sorting a sequence of items, introduced by A. K. Dewdney in his Scientific American column. This...

maximum value is at most k. In some descriptions of counting sort, the input to be sorted is assumed to be more simply a sequence of integers itself, but...

element produces a sorted list. Such a list is said to be h-sorted. It can also be thought of as h interleaved lists, each individually sorted. Beginning with...

partial sorting is returning a list of the k smallest (or k largest) elements in order. The other elements (above the k smallest ones) may also be sorted, as...

Another method is for numbers to be sorted alphabetically as they would be spelled: for example 1776 would be sorted as if spelled out "seventeen seventy-six"...

representations. A sequence like [b, c, e, d, f, g, ba] would be sorted as [b, ba, c, d, e, f, g]. If lexicographic ordering is used to sort variable-length...

elements of some prefix of the sequence. Now, the number of comparisons is irrelevant. The minimum number of flips required to sort any stack of n pancakes has...

already sorted, so only the less-than and greater-than partitions need to be recursively sorted. In pseudocode, the quicksort algorithm becomes: // Sorts (a...

z ) = ∑ k = 0 ∞ F k z k − ∑ k = 0 ∞ F k z k + 1 − ∑ k = 0 ∞ F k z k + 2 = ∑ k = 0 ∞ F k z k − ∑ k = 1 ∞ F k − 1 z k − ∑ k = 2 ∞ F k − 2 z k = 0 z 0 +...

In combinatorial mathematics, a de Bruijn sequence of order n on a size-k alphabet A is a cyclic sequence in which every possible length-n string on A...

already sorted, but the algorithm does not know if it is completed. The algorithm needs one additional whole pass without any swap to know it is sorted. Third...

term of a sequence of numbers is equal to some combination of the previous terms. Often, only k {\displaystyle k} previous terms of the sequence appear in...

computer science, the sorting numbers are a sequence of numbers introduced in 1950 by Hugo Steinhaus for the analysis of comparison sort algorithms. These...

number of the sequence. Repeat step 2. The sequence is called a Kaprekar sequence and the function K b ( n ) = α − β {\displaystyle K_{b}(n)=\alpha -\beta...

is a list of notable integer sequences with links to their entries in the On-Line Encyclopedia of Integer Sequences. OEIS core sequences Index to OEIS...

pair. Recursively sort the ⌊ n / 2 ⌋ {\displaystyle \lfloor n/2\rfloor } larger elements from each pair, creating a sorted sequence S {\displaystyle S}...

factor sorted := false loop while sorted = false // Update the gap value for a next comb gap := floor(gap / shrink) if gap ≤ 1 then gap := 1 sorted := true...

already close to sorted, according to some measure of sortedness, the number of comparisons required to sort it can be smaller. An adaptive sort takes advantage...

called a k-merger, which is described in the section below. A k-merger takes k {\displaystyle k} sorted sequences. Upon one invocation of a k-merger, it...

in sorted order. Sorting is done based on one or more sort keys extracted from each line of input. By default, the entire input is taken as sort key...

a k-regular sequence is a sequence satisfying linear recurrence equations that reflect the base-k representations of the integers. The class of k-regular...

under the Morgan–Keenan (MK) system using the letters O, B, A, F, G, K, and M, a sequence from the hottest (O type) to the coolest (M type). Each letter class...