sorting key
Смотреть что такое "sorting key" в других словарях:
key punch — n. a machine, operated from a keyboard, used to record data by punching holes in cards that can then be fed into machines for sorting, accounting, etc. * * * … Universalium
key punch — n. a machine, operated from a keyboard, used to record data by punching holes in cards that can then be fed into machines for sorting, accounting, etc … English World dictionary
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Sorting — For the sorting of sediment, see Sorting (sediment). Sorting type Sorting is any process of arranging items in some sequence and/or in different sets, and accordingly, it has two common, yet distinct meanings: ordering: arranging items of the… … Wikipedia
Key Word in Context — KWIC is an acronym for Key Word In Context, the most common format for concordance lines. The term KWIC was first coined by Hans Peter Luhn. [Manning, C. D., Schütze, H.: Foundations of Statistical Natural Language Processing , p.35. The MIT… … Wikipedia
key field — field according to which a sorting procedure is performed … English contemporary dictionary
sorting program — program which performs sorts according to a specific key in data files … English contemporary dictionary
Topological sorting — Dependency resolution redirects here. For other uses, see Dependency (disambiguation). In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that, for every edge uv, u comes… … Wikipedia
Branching identification key — A branching identification key is a presentation form of a single access key where the structure of the decision tree is displayed graphically as a branching structure, involving lines between items. [Winston, J. 1999. Describing Species.… … Wikipedia
Comparison sort — Sorting a set of unlabelled weights by weight using only a balance scale requires a comparison sort algorithm A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often … 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
