- tournament sort
- сортировка повторной выборкой
Большой англо-русский и русско-английский словарь. 2001.
tournament sort
Смотреть что такое "tournament sort" в других словарях:
Tournament sort — is a comparison sort algorithm. This method of sorting is quite efficientvague but requires memory of past comparisons. It involves several rounds of comparisons, much like a tournament among teams or players.Let’s assume that there are 32 keys… … Wikipedia
Unreal Tournament — Pour les articles homonymes, voir UT. Unreal Tournament Éditeur … Wikipédia en Français
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
Counting sort — In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct… … Wikipedia
Comb sort — Class Sorting algorithm Data structure Array Worst case performance O(n log n)[1] … Wikipedia
Cocktail sort — Class Sorting algorithm Data structure Array Worst case performance О(n²) Best case performance O(n) … Wikipedia
Pigeonhole sort — Class Sorting algorithm Data structure Array Worst case performance O(N + n), where N is the range of key values and n is the input size Worst case space complexity O(N * n) … Wikipedia
Cycle sort — Example of cycle sort sorting a list of random numbers. Class Sorting algorithm Data structure Array Worst case performance Θ(n2) … Wikipedia
Odd–even sort — Example of odd even transposition sort sorting a list of random numbers. Class Sorting algorithm Data structure Array Worst case performance … Wikipedia
UAAP Season 71 men's basketball tournament — Infobox PhilCollFinals title=UAAP Season 71 Men s Basketball tagline= Madrama higherseed = UAAPteam|Ateneo lowerseed = UAAPteam|La Salle higherseed game1 = 69 higherseed game2 = 62 higherseed series = 2 lowerseed game1 = 61| lowerseed game2 = 51… … Wikipedia
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
