Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Pigeonhole_sort> ?p ?o. }
Showing items 1 to 39 of
39
with 100 items per page.
- Pigeonhole_sort abstract "Pigeonhole sorting, also known as count sort (not to be confused with counting sort), is a sorting algorithm that is suitable for sorting lists of elements where the number of elements (n) and the number of possible key values (N) are approximately the same. It requires O(n + N) time.The pigeonhole algorithm works as follows: Given an array of values to be sorted, set up an auxiliary array of initially empty "pigeonholes," one pigeonhole for each key through the range of the original array. Going over the original array, put each value into the pigeonhole corresponding to its key, such that each pigeonhole eventually contains a list of all values with that key. Iterate over the pigeonhole array in order, and put elements from non-empty pigeonholes back into the original array.↑".
- Pigeonhole_sort wikiPageID "24681".
- Pigeonhole_sort wikiPageRevisionID "576409017".
- Pigeonhole_sort class Sorting_algorithm.
- Pigeonhole_sort data Array_data_structure.
- Pigeonhole_sort hasPhotoCollection Pigeonhole_sort.
- Pigeonhole_sort optimal "If and only if".
- Pigeonhole_sort time ", where N is the range of key values and n is the input size".
- Pigeonhole_sort subject Category:Sorting_algorithms.
- Pigeonhole_sort subject Category:Stable_sorts.
- Pigeonhole_sort type Abstraction100002137.
- Pigeonhole_sort type Act100030358.
- Pigeonhole_sort type Activity100407535.
- Pigeonhole_sort type Algorithm105847438.
- Pigeonhole_sort type Category105838765.
- Pigeonhole_sort type Cognition100023271.
- Pigeonhole_sort type Concept105835747.
- Pigeonhole_sort type Content105809192.
- Pigeonhole_sort type Event100029378.
- Pigeonhole_sort type Idea105833840.
- Pigeonhole_sort type Kind105839024.
- Pigeonhole_sort type Procedure101023820.
- Pigeonhole_sort type PsychologicalFeature100023100.
- Pigeonhole_sort type Rule105846932.
- Pigeonhole_sort type SortingAlgorithm105847658.
- Pigeonhole_sort type SortingAlgorithms.
- Pigeonhole_sort type StableSorts.
- Pigeonhole_sort type YagoPermanentlyLocatedEntity.
- Pigeonhole_sort comment "Pigeonhole sorting, also known as count sort (not to be confused with counting sort), is a sorting algorithm that is suitable for sorting lists of elements where the number of elements (n) and the number of possible key values (N) are approximately the same. It requires O(n + N) time.The pigeonhole algorithm works as follows: Given an array of values to be sorted, set up an auxiliary array of initially empty "pigeonholes," one pigeonhole for each key through the range of the original array.".
- Pigeonhole_sort label "Pigeonhole sort".
- Pigeonhole_sort label "鳩の巣ソート".
- Pigeonhole_sort label "鸽巢排序".
- Pigeonhole_sort sameAs 鳩の巣ソート.
- Pigeonhole_sort sameAs m.065bq.
- Pigeonhole_sort sameAs Q3235843.
- Pigeonhole_sort sameAs Q3235843.
- Pigeonhole_sort sameAs Pigeonhole_sort.
- Pigeonhole_sort wasDerivedFrom Pigeonhole_sort?oldid=576409017.
- Pigeonhole_sort isPrimaryTopicOf Pigeonhole_sort.