- sublists
- Подсписки
Большой англо-русский и русско-английский словарь. 2001.
sublists
Смотреть что такое "sublists" в других словарях:
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
Dead Runners Society — The DRS flag includes a smiley emoticon, symbolizing computers, and a star, symbolizing the Lone Star State of Texas, where the group was founded in 1991 The Dead Runners Society (DRS) is a worldwide online running club. DRS is notable for its… … Wikipedia
Quicksort — Infobox Algorithm class=Sorting algorithm Quicksort in action on a list of numbers. The horizontal lines are pivot values. data=Varies time=O(nlog n) on average space=Varies by implementation optimal=Sometimes Stability= [Sorting… … 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
Xargs — xargs(pronounced zargs) is a command of Unix and most Unix like operating systems. It is useful when one wants to pass a large number of arguments to a command. Arbitrarily long lists of parameters can t be passed to a command, [… … Wikipedia
C4.5 algorithm — C4.5 is an algorithm used to generate a decision tree developed by Ross Quinlan. C4.5 is an extension of Quinlan s earlier ID3 algorithm. The decision trees generated by C4.5 can be used for classification, and for this reason, C4.5 is often… … Wikipedia
Spreadsort — [http://sourceforge.net/projects/spreadsort/ Spreadsort] is a relatively new sorting algorithm invented by Steven J. Ross in 2002. [Steven J. Ross. The Spreadsort High performance General case Sorting Algorithm. Parallel and Distributed… … Wikipedia
Academic word list — The Academic Word List (AWL) was developed by Averil Coxhead at the School of Linguistics and Applied Language Studies at Victoria University of Wellington, New Zealand. The list contains 570 semantic fields which were selected because they… … Wikipedia
Erlang (programming language) — Erlang Paradigm(s) multi paradigm: concurrent, functional Appeared in 1986 Designed by Ericsson … 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
