Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Selection_algorithm> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Selection_algorithm abstract "In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list or array; such a number is called the kth order statistic. This includes the cases of finding the minimum, maximum, and median elements. There are O(n) (worst-case linear time) selection algorithms, and sublinear performance is possible for structured data; in the extreme, O(1) for an array of sorted data. Selection is a subproblem of more complex problems like the nearest neighbor problem and shortest path problems. Many selection algorithms are derived by generalizing a sorting algorithm, and conversely some sorting algorithms can be derived as repeated application of selection.The simplest case of a selection algorithm is finding the minimum (or maximum) element by iterating through the list, keeping track of the running minimum – the minimum so far – (or maximum) and can be seen as related to the selection sort. Conversely, the hardest case of a selection algorithm is finding the median, and this necessarily takes n/2 storage. In fact, a specialized median-selection algorithm can be used to build a general selection algorithm, as in median of medians. The best-known selection algorithm is quickselect, which is related to quicksort; like quicksort, it has (asymptotically) optimal average performance, but poor worst-case performance, though it can be modified to give optimal worst-case performance as well.".
- Selection_algorithm wikiPageExternalLink 960125.html.
- Selection_algorithm wikiPageExternalLink partial_sort.html.
- Selection_algorithm wikiPageExternalLink Sort::Key::Top.
- Selection_algorithm wikiPageExternalLink Statistics::CaseResampling.
- Selection_algorithm wikiPageID "552786".
- Selection_algorithm wikiPageRevisionID "605182720".
- Selection_algorithm hasPhotoCollection Selection_algorithm.
- Selection_algorithm subject Category:Selection_algorithms.
- Selection_algorithm type Abstraction100002137.
- Selection_algorithm type Act100030358.
- Selection_algorithm type Activity100407535.
- Selection_algorithm type Algorithm105847438.
- Selection_algorithm type Event100029378.
- Selection_algorithm type Procedure101023820.
- Selection_algorithm type PsychologicalFeature100023100.
- Selection_algorithm type Rule105846932.
- Selection_algorithm type SelectionAlgorithms.
- Selection_algorithm type YagoPermanentlyLocatedEntity.
- Selection_algorithm comment "In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list or array; such a number is called the kth order statistic. This includes the cases of finding the minimum, maximum, and median elements. There are O(n) (worst-case linear time) selection algorithms, and sublinear performance is possible for structured data; in the extreme, O(1) for an array of sorted data.".
- Selection_algorithm label "Médiane des médianes".
- Selection_algorithm label "Selection algorithm".
- Selection_algorithm label "Selekcja (informatyka)".
- Selection_algorithm label "خوارزمية الاختيار".
- Selection_algorithm label "選択アルゴリズム".
- Selection_algorithm sameAs Médiane_des_médianes.
- Selection_algorithm sameAs Algoritma_seleksi.
- Selection_algorithm sameAs 選択アルゴリズム.
- Selection_algorithm sameAs Selekcja_(informatyka).
- Selection_algorithm sameAs m.02p7mt.
- Selection_algorithm sameAs Q3252726.
- Selection_algorithm sameAs Q3252726.
- Selection_algorithm sameAs Selection_algorithm.
- Selection_algorithm wasDerivedFrom Selection_algorithm?oldid=605182720.
- Selection_algorithm isPrimaryTopicOf Selection_algorithm.