sort pass
Смотреть что такое "sort pass" в других словарях:
sort — sort1 W1S1 [so:t US so:rt] n ▬▬▬▬▬▬▬ 1¦(type/kind)¦ 2 sort of 3 of sorts/of a sort 4 sort of thing 5 what sort of ...? 6 nothing of the sort 7¦(person)¦ 8 it takes all sorts (to make a world) 9¦(computer)¦ 10¦(ill/ … Dictionary of contemporary English
sort — 1 noun 1 TYPE (C) especially BrE a group or class of people, things etc that have similar qualities or features; type (+ of): What sort of shampoo do you use? | all sorts of (=a lot of different types of things): soup flavoured with all sorts of… … Longman dictionary of contemporary English
Cocktail sort — Class Sorting algorithm Data structure Array Worst case performance О(n²) Best case performance O(n) … 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
Bubble sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=NoBubble sort is a simple sorting algorithm. It works by repeatedly stepping through the list to be sorted, comparing two items at a time… … Wikipedia
Selection sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=Not usuallySelection sort is a sorting algorithm, specifically an in place comparison sort. It has O( n 2) complexity, making it… … Wikipedia
Comb sort — Class Sorting algorithm Data structure Array Worst case performance O(n log n)[1] … Wikipedia
Insertion sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=Not usuallyInsertion sort is a simple sorting algorithm, a comparison sort in which the sorted array (or list) is built one entry at a time … Wikipedia
Bucket sort — Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting… … Wikipedia
One-pass algorithm — In computing, a one pass algorithm is one which reads its input exactly once, in order, without unbounded buffering. A one pass algorithm generally requires O(n) (see big O notation) time and less than O(n) storage (typically O(1)), where n is… … Wikipedia
Mountain pass — This article is about a path between two mountains. For the rare earth mine, see Mountain Pass rare earth mine. For the town, see Mountain Pass, California. The saddle between Mount Washington and Mount Clay … Wikipedia
