Splaysort, the Glossary

Table of Contents

1. 17 relations: Adaptive sort, Algorithm, Amortized analysis, Comparison sort, Computer science, Data structure, Entropy (information theory), Heapsort, Insertion sort, Inversion (discrete mathematics), Lecture Notes in Computer Science, Merge sort, Quicksort, SIAM Journal on Computing, Splay tree, Tree sort, Tree traversal.

2. Sorting algorithms

Adaptive sort

A sorting algorithm falls into the adaptive sort family if it takes advantage of existing order in its input. Splaysort and adaptive sort are sorting algorithms.

See Splaysort and Adaptive sort

Algorithm

In mathematics and computer science, an algorithm is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation.

See Splaysort and Algorithm

Amortized analysis

In computer science, amortized analysis is a method for analyzing a given algorithm's complexity, or how much of a resource, especially time or memory, it takes to execute.

See Splaysort and Amortized analysis

Comparison sort

A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a "less than or equal to" operator or a three-way comparison) that determines which of two elements should occur first in the final sorted list.

See Splaysort and Comparison sort

Computer science

Computer science is the study of computation, information, and automation.

See Splaysort and Computer science

Data structure

In computer science, a data structure is a data organization, and storage format that is usually chosen for efficient access to data.

See Splaysort and Data structure

Entropy (information theory)

In information theory, the entropy of a random variable is the average level of "information", "surprise", or "uncertainty" inherent to the variable's possible outcomes.

See Splaysort and Entropy (information theory)

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.

See Splaysort and Heapsort

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 Splaysort and Insertion sort

Inversion (discrete mathematics)

In computer science and discrete mathematics, an inversion in a sequence is a pair of elements that are out of their natural order. Splaysort and inversion (discrete mathematics) are sorting algorithms.

See Splaysort and Inversion (discrete mathematics)

Lecture Notes in Computer Science

Lecture Notes in Computer Science is a series of computer science books published by Springer Science+Business Media since 1973.

See Splaysort and Lecture Notes in Computer Science

Merge sort

In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm.

See Splaysort and Merge sort

Quicksort

Quicksort is an efficient, general-purpose sorting algorithm.

See Splaysort and Quicksort

SIAM Journal on Computing

The SIAM Journal on Computing is a scientific journal focusing on the mathematical and formal aspects of computer science.

See Splaysort and SIAM Journal on Computing

Splay tree

A splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again.

See Splaysort and Splay tree

Tree sort

A tree sort is a sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted order. Splaysort and tree sort are sorting algorithms.

See Splaysort and Tree sort

Tree traversal

In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting (e.g. retrieving, updating, or deleting) each node in a tree data structure, exactly once.

See Splaysort and Tree traversal

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

References

[1] https://en.wikipedia.org/wiki/Splaysort