n
(programming) Any of the subarrays that make up a larger array-like data structure whose elements do not have to be stored contiguously.
n
(computing) A sorting algorithm in which pairs of neighboring values are compared and swapped into the right order if necessary in the innermost loop.
n
(computing theory) A sorting algorithm that partitions an array into a number of buckets (groups of elements) which are then individually sorted, either recursively or using some other algorithm.
n
Alternative form of bucket sort [(computing theory) A sorting algorithm that partitions an array into a number of buckets (groups of elements) which are then individually sorted, either recursively or using some other algorithm.]
adj
Abbreviation of co-recursively enumerable. [(computing theory) Describing a set for which there exists a deterministic algorithm that will list all items not in that set.]
n
A factor that is multiplied with the result of an equation to correct for a known amount of systematic error.
n
(computing) A sorting algorithm that counts how many times each integer key appears in an array and then reorders the array based on those counts.
n
(computing theory) A parallel sorting algorithm that builds a self-balancing multidimensional array from the keys to be sorted.
n
(computing theory) A sorting algorithm based on the idea that the permutation to be sorted can be factored into cycles that can be rotated individually to give a sorted result.
n
(programming) An enumeration.
adj
(computing theory) Of or relating to a fast but non-optimal algorithm for the Bin packing problem, placing each item into the first bin in which it will fit.
n
(computing theory) A variation of the insertion sort that does not use nested loops.
n
(computer science) The problem of deciding in finite time whether a given program will finish running in finite time, when given a certain finite input.
n
(computing) A sorting algorithm based on the heap data structure.
n
(computer science) A sorting algorithm that performs its task by inserting new items into a pre-existing sorted data structure.
n
(computing) A sorting algorithm that begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted.
n
(computing theory) A form of insertion sort that leaves gaps between elements to accelerate subsequent insertions.
n
(computing) Synonym of mergesort
n
Alternative spelling of mergesort [(computing) A divide and conquer sorting algorithm that operates by dividing the items to be sorted into many small lists and gradually merging them together.]
n
(computing) A divide and conquer sorting algorithm that operates by dividing the items to be sorted into many small lists and gradually merging them together.
n
(arithmetic) A number or quantity from which another is to be subtracted.
n
(mathematics) The mathematical problem of sorting a disordered stack of pancakes in order of size when a spatula can be inserted at any point in the stack and used to flip all pancakes above it.
n
(computing theory) A concurrent programming algorithm for mutual exclusion that allows two or more processes to share a single-use resource without conflict, using only shared memory for communication.
n
(computing) An element of a set to be sorted that is chosen as a midpoint, so as to divide the other elements into two groups to be dealt with recursively.
n
(computing theory) Recursion to a fixed depth.
n
(computing) A sorting algorithm related to quicksort, but with limited recursion.
n
(computing) A sorting algorithm that operates by recursively partitioning the items to be sorted into two sets.
n
Abbreviation of random sample consensus., an iterative method to estimate parameters of a mathematical model from a set of observed data which contains outliers.
n
(computing) A variant of the Fisher-Yates shuffle that generates uniformly distributed cycles of some maximal length n, rather than permutations of the entire sequence.
n
(computing theory) A sorting algorithm that divides the input list into two sublists — items already sorted, and items not yet sorted — and gradually transfers elements from one list to the other.
adj
(computing theory) Of a data structure: able to maintain a small height (number of levels) regardless of insertions and deletions.
n
Alternative form of Shellsort [(computing theory) A sorting algorithm that starts by sorting pairs of elements that are far apart from each other, then progressively reduces the gap between elements to be compared.]
n
(computing theory) A probabilistic data structure that allows fast search within an ordered sequence of elements by maintaining a linked hierarchy of subsequences, with each successive subsequence skipping over fewer elements than the previous one.
n
(computing theory) A sorting algorithm based on heapsort but using the Leonardo numbers, tending to perform better than heapsort in cases where the items to be sorted are already partially sorted.
n
(computing) An algorithm for sorting a list of items into a particular sequence.
n
(computing) A key value used to identify where to split the children of a parent node in a B-tree or similar data structure.
n
(programming) A contiguous subset of an array.
n
A combination that is a subset of another combination, containing only some of its elements.
n
A curve forming part of another curve.
n
(mathematics, computing) An algorithmic technique involving integration with progressively smaller steps
n
A subset of a dictionary
n
One of a series of stacked equations in a document.
n
(computing theory) A heap (data structure) making up part of a larger heap.
n
(graph theory) A subset of a marking of a Petri net.
n
(graph theory) A path making up part of a larger path (the superpath).
n
(mathematics) A proof that makes up part of a larger proof.
n
(electronics) A subset / subgrid of a raster
n
A subset of a repeat (iteration)
n
(computer science) A subset of an array with the same ordering.
n
The sorting of a subset of already sorted elements.
n
(graph theory) A tour that makes up part of a larger tour.
n
(computer science) A trie data structure making up part of a larger trie.
n
(mathematics) A subscript.
n
The schema that contains a given subschema.
n
(computing theory) A sorting algorithm derived from mergesort and insertion sort, designed to perform well on many kinds of real-world data.
adj
(computing) Replaced or supplemented with a wildcard character to allow matching against a range of possible values.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 8 letters and means "Believable and worthy of trust." Can you find it?