- ascending sorting
- мат. сортировка по возрастанию
Большой англо-русский и русско-английский словарь. 2001.
ascending sorting
Смотреть что такое "ascending sorting" в других словарях:
ascending sort order — sorting order from smallest to largest or from A Z … English contemporary dictionary
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
Sorting network — A sorting network is an abstract mathematical model of a network of wires and comparator modules that is used to sort a sequence of numbers. Each comparator connects two wires and sort the values by outputting the smaller value to one wire, and a … 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
Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… … Wikipedia
Collation — This article is about collation in library, information, and computer science. For other uses, see Collation (disambiguation). Alphabetical redirects here. For the type of writing system, see Alphabet. For the album, see Alphabetical (album). A–Z … Wikipedia
Windows Explorer — This article is about the Windows file system browser. For the similarly named web browser, see Internet Explorer Windows Explorer A component of Microsoft Windows Details Included with Microsoft Windows … Wikipedia
Cocktail sort — Class Sorting algorithm Data structure Array Worst case performance О(n²) Best case performance O(n) … Wikipedia
Batcher odd–even mergesort — Visualization of the odd–even mergesort network with eight inputs Batcher s odd–even mergesort is a generic construction devised by Ken Batcher for sorting networks of size O(n (log n)2) and depth O((log n)2), where n is the number … Wikipedia
List of Deadliest Catch episodes — This is a list of Deadliest Catch episodes with original airdate on Discovery Channel. Airdates on Discovery Channel Canada generally differ. Contents 1 Pilot 2 Season 1 3 Season 2 4 Season 3 … Wikipedia
Unit record equipment — Before the advent of electronic computers, data processing was performed using electromechanical devices called unit record equipment, electric accounting machines (EAM) or tabulating machines. Unit record machines were as ubiquitous in industry… … Wikipedia
