Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Integer_sorting> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Integer_sorting abstract "In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by numeric keys, each of which is an integer. Algorithms designed for integer sorting may also often be applied to sorting problems in which the keys are floating point numbers or text strings. The ability to perform integer arithmetic on the keys allows integer sorting algorithms to be faster than comparison sorting algorithms in many cases, depending on the details of which operations are allowed in the model of computing and how large the integers to be sorted are.The classical integer sorting algorithms of bucket sort, counting sort, and radix sort are widely used and practical. Much of the subsequent research on integer sorting algorithms has focused less on practicality and more on theoretical improvements in their worst case analysis, and the algorithms that come from this line of research are not believed to be practical for current 64-bit computer architectures, althoughexperiments have shown that some of these methods may be an improvement on radix sorting for data with 128 or more bits per key. Additionally, for large data sets, the near-random memory access patterns of many integer sorting algorithms can handicap them compared to comparison sorting algorithms that have been designed with the memory hierarchy in mind.Integer sorting provides one of the six benchmarks in the DARPA High Productivity Computing Systems Discrete Mathematics benchmark suite, and one of eleven benchmarks in the NAS Parallel Benchmarks suite.".
- Integer_sorting wikiPageExternalLink citation.cfm?id=644221.
- Integer_sorting wikiPageExternalLink WAEMS.pdf.
- Integer_sorting wikiPageExternalLink pedersen99.ps.
- Integer_sorting wikiPageExternalLink win_mcilroy.pdf.
- Integer_sorting wikiPageID "31552761".
- Integer_sorting wikiPageRevisionID "597671538".
- Integer_sorting hasPhotoCollection Integer_sorting.
- Integer_sorting subject Category:Sorting_algorithms.
- Integer_sorting type Abstraction100002137.
- Integer_sorting type Act100030358.
- Integer_sorting type Activity100407535.
- Integer_sorting type Algorithm105847438.
- Integer_sorting type Event100029378.
- Integer_sorting type Procedure101023820.
- Integer_sorting type PsychologicalFeature100023100.
- Integer_sorting type Rule105846932.
- Integer_sorting type SortingAlgorithm105847658.
- Integer_sorting type SortingAlgorithms.
- Integer_sorting type YagoPermanentlyLocatedEntity.
- Integer_sorting comment "In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by numeric keys, each of which is an integer. Algorithms designed for integer sorting may also often be applied to sorting problems in which the keys are floating point numbers or text strings.".
- Integer_sorting label "Integer sorting".
- Integer_sorting sameAs m.0glt40r.
- Integer_sorting sameAs Q13407970.
- Integer_sorting sameAs Q13407970.
- Integer_sorting sameAs Integer_sorting.
- Integer_sorting wasDerivedFrom Integer_sorting?oldid=597671538.
- Integer_sorting isPrimaryTopicOf Integer_sorting.