Flashsort, the Glossary
Flashsort is a distribution sorting algorithm showing ''O''(''n'') for uniformly distributed data sets and relatively little additional memory requirement.[1]
Table of Contents
19 relations: A priori and a posteriori, Big O notation, Bucket sort, CPU cache, Cycles and fixed points, Heapsort, In-place algorithm, Insertion sort, Interpolation search, Interpolation sort, Loop invariant, Mathematical induction, Memory hierarchy, Prefix sum, Probability distribution, Q.E.D., Quantile, Quicksort, Search algorithm.
- Sorting algorithms
A priori and a posteriori
A priori ('from the earlier') and a posteriori ('from the later') are Latin phrases used in philosophy to distinguish types of knowledge, justification, or argument by their reliance on experience.
See Flashsort and A priori and a posteriori
Big O notation
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.
See Flashsort and Big O notation
Bucket sort
Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Flashsort and bucket sort are sorting algorithms.
CPU cache
A CPU cache is a hardware cache used by the central processing unit (CPU) of a computer to reduce the average cost (time or energy) to access data from the main memory.
Cycles and fixed points
In mathematics, the cycles of a permutation of a finite set S correspond bijectively to the orbits of the subgroup generated by acting on S. These orbits are subsets of S that can be written as, such that The corresponding cycle of is written as (c1 c2... cn); this expression is not unique since c1 can be chosen to be any element of the orbit.
See Flashsort and Cycles and fixed points
Heapsort
In computer science, heapsort is a comparison-based sorting algorithm which can be thought of as "an implementation of selection sort using the right data structure." Like selection sort, heapsort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element from it and inserting it into the sorted region.
In-place algorithm
In computer science, an in-place algorithm is an algorithm that operates directly on the input data structure without requiring extra space proportional to the input size.
See Flashsort and In-place algorithm
Insertion sort
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons.
See Flashsort and Insertion sort
Interpolation search
Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).
See Flashsort and Interpolation search
Interpolation sort
Interpolation sort is a sorting algorithm that is a kind of bucket sort. Flashsort and Interpolation sort are sorting algorithms.
See Flashsort and Interpolation sort
Loop invariant
In computer science, a loop invariant is a property of a program loop that is true before (and after) each iteration.
See Flashsort and Loop invariant
Mathematical induction
Mathematical induction is a method for proving that a statement P(n) is true for every natural number n, that is, that the infinitely many cases P(0), P(1), P(2), P(3), \dots  all hold.
See Flashsort and Mathematical induction
Memory hierarchy
In computer organisation, the memory hierarchy separates computer storage into a hierarchy based on response time.
See Flashsort and Memory hierarchy
Prefix sum
In computer science, the prefix sum, cumulative sum, inclusive scan, or simply scan of a sequence of numbers is a second sequence of numbers, the sums of prefixes (running totals) of the input sequence: For instance, the prefix sums of the natural numbers are the triangular numbers: |- !input numbers | 1 || 2 || 3 || 4 || 5 || 6 ||...
Probability distribution
In probability theory and statistics, a probability distribution is the mathematical function that gives the probabilities of occurrence of possible outcomes for an experiment.
See Flashsort and Probability distribution
Q.E.D.
Q.E.D. or QED is an initialism of the Latin phrase quod erat demonstrandum, meaning "that which was to be demonstrated".
Quantile
In statistics and probability, quantiles are cut points dividing the range of a probability distribution into continuous intervals with equal probabilities, or dividing the observations in a sample in the same way.
Quicksort
Quicksort is an efficient, general-purpose sorting algorithm.
Search algorithm
In computer science, a search algorithm is an algorithm designed to solve a search problem.
See Flashsort and Search algorithm
See also
Sorting algorithms
- Adaptive sort
- Batcher odd–even mergesort
- Bead sort
- Bitonic sorter
- Block swap algorithms
- Bucket sort
- Cartesian tree
- Counting sort
- Dutch national flag problem
- Elevator algorithm
- External sorting
- Flashsort
- Integer sorting
- Internal sort
- Interpolation sort
- Inversion (discrete mathematics)
- K-sorted sequence
- K-way merge algorithm
- Kaprekar's routine
- Kirkpatrick–Reisch sort
- Median cut
- Merge algorithm
- Pairwise sorting network
- Pancake sorting
- Partial sorting
- Pigeonhole sort
- Pre-topological order
- Proxmap sort
- Qsort
- Quantum sort
- Radix sort
- Run of a sequence
- Samplesort
- Schwartzian transform
- Slowsort
- Sort (C++)
- Sort (Unix)
- Sorting
- Sorting algorithm
- Sorting network
- Spaghetti sort
- Splaysort
- Spreadsort
- Strand sort
- Topological sorting
- Tournament sort
- Tree sort
- X + Y sorting