- tree(-structure) sort
-
древовидная сортировка
Англо-русский словарь технических терминов. 2005.
tree(-structure) sort
Смотреть что такое "tree(-structure) sort" в других словарях:
Tree of life — For other uses, see Tree of life (disambiguation). An 1847 depiction of the Norse Yggdrasil as described in the Icelandic Prose Edda by Oluf Olufsen Bagge The concept of a tree of life, a many branched tree illustrating the idea that all life on… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia
Hilbert R-tree — Hilbert R tree, an R tree variant, is an index for multidimensional objects like lines, regions, 3 D objects, or high dimensional feature based parametric objects. It can be thought of as an extension to B+ tree for multidimensional objects.The… … Wikipedia
B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… … Wikipedia
Exponential tree — An exponential tree is almost identical to a binary search tree, with the exception that the dimension of the tree is not the same at all levels. In a normal binary search tree, each node has a dimension ( d ) of 1, and has 2 d children. In an… … Wikipedia
Stern-Brocot tree — NOTOC In number theory, the Stern Brocot tree is a method of listing all non negative rational numbers (as well as a point representing infinity here represented formally as 1/0) in a tree structure. It was discovered independently by Moritz… … Wikipedia
One Tree Hill (TV series) — One Tree Hill Intertitle, seasons 1–4; 8 Genre Drama, Sports Format Teen drama … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Merge sort — Example of merge sort sorting a list of random dots. Class Sorting algorithm Data structure Array Worst case performance O(n log n) … Wikipedia
R-tree — R trees are tree data structures that are similar to B trees, but are used for spatial access methods i.e., for indexing multi dimensional information; for example, the (X, Y) coordinates of geographical data. A common real world usage for an R… … Wikipedia
