Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q830223> ?p ?o }
Showing triples 1 to 80 of
80
with 100 triples per page.
- Q830223 subject Q6397419.
- Q830223 subject Q7015109.
- Q830223 subject Q8772745.
- Q830223 abstract "In computer science, radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value. A positional notation is required, but because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is not limited to integers. Radix sort dates back as far as 1887 to the work of Herman Hollerith on tabulating machines.Most digital computers internally represent all of their data as electronic representations of binary numbers, so processing the digits of integer representations by groups of binary digit representations is most convenient. Two classifications of radix sorts are least significant digit (LSD) radix sorts and most significant digit (MSD) radix sorts. LSD radix sorts process the integer representations starting from the least digit and move towards the most significant digit. MSD radix sorts work the other way around.LSD radix sorts typically use the following sorting order: short keys come before longer keys, and keys of the same length are sorted lexicographically. This coincides with the normal order of integer representations, such as the sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11.MSD radix sorts use lexicographic order, which is suitable for sorting strings, such as words, or fixed-length integer representations. A sequence such as "b, c, d, e, f, g, h, i, j, ba" would be lexicographically sorted as "b, ba, c, d, e, f, g, h, i, j". If lexicographic ordering is used to sort variable-length integer representations, then the representations of the numbers from 1 to 10 would be output as 1, 10, 2, 3, 4, 5, 6, 7, 8, 9, as if the shorter keys were left-justified and padded on the right with blank characters to make the shorter keys as long as the longest key for the purpose of determining sorted order.".
- Q830223 wikiPageExternalLink Home.
- Q830223 wikiPageExternalLink acsc03sz.pdf.
- Q830223 wikiPageExternalLink 11_2_Counting_Sort_Radix_So.html.
- Q830223 wikiPageExternalLink 11_2_Counting_Sort_Radix_So.html.
- Q830223 wikiPageExternalLink RadixSort.
- Q830223 wikiPageExternalLink bradsort.c.
- Q830223 wikiPageExternalLink RadixSortRevisited.htm.
- Q830223 wikiPageExternalLink Radix.
- Q830223 wikiPageExternalLink radix.html.
- Q830223 wikiPageWikiLink Q1056761.
- Q830223 wikiPageWikiLink Q1124964.
- Q830223 wikiPageWikiLink Q1141518.
- Q830223 wikiPageWikiLink Q1144915.
- Q830223 wikiPageWikiLink Q117241.
- Q830223 wikiPageWikiLink Q1195339.
- Q830223 wikiPageWikiLink Q1210082.
- Q830223 wikiPageWikiLink Q121079.
- Q830223 wikiPageWikiLink Q126002.
- Q830223 wikiPageWikiLink Q13407970.
- Q830223 wikiPageWikiLink Q1413513.
- Q830223 wikiPageWikiLink Q1606072.
- Q830223 wikiPageWikiLink Q170008.
- Q830223 wikiPageWikiLink Q17457.
- Q830223 wikiPageWikiLink Q1747853.
- Q830223 wikiPageWikiLink Q1754095.
- Q830223 wikiPageWikiLink Q179976.
- Q830223 wikiPageWikiLink Q181593.
- Q830223 wikiPageWikiLink Q183414.
- Q830223 wikiPageWikiLink Q184754.
- Q830223 wikiPageWikiLink Q1867374.
- Q830223 wikiPageWikiLink Q189057.
- Q830223 wikiPageWikiLink Q192145.
- Q830223 wikiPageWikiLink Q19798622.
- Q830223 wikiPageWikiLink Q2005.
- Q830223 wikiPageWikiLink Q2024396.
- Q830223 wikiPageWikiLink Q21198.
- Q830223 wikiPageWikiLink Q220543.
- Q830223 wikiPageWikiLink Q223655.
- Q830223 wikiPageWikiLink Q232661.
- Q830223 wikiPageWikiLink Q243754.
- Q830223 wikiPageWikiLink Q2524992.
- Q830223 wikiPageWikiLink Q2565212.
- Q830223 wikiPageWikiLink Q2632949.
- Q830223 wikiPageWikiLink Q269878.
- Q830223 wikiPageWikiLink Q3235843.
- Q830223 wikiPageWikiLink Q325904.
- Q830223 wikiPageWikiLink Q36161.
- Q830223 wikiPageWikiLink Q387015.
- Q830223 wikiPageWikiLink Q474095.
- Q830223 wikiPageWikiLink Q486598.
- Q830223 wikiPageWikiLink Q49108.
- Q830223 wikiPageWikiLink Q4918918.
- Q830223 wikiPageWikiLink Q4983022.
- Q830223 wikiPageWikiLink Q5660912.
- Q830223 wikiPageWikiLink Q578036.
- Q830223 wikiPageWikiLink Q60864.
- Q830223 wikiPageWikiLink Q625642.
- Q830223 wikiPageWikiLink Q636609.
- Q830223 wikiPageWikiLink Q6387298.
- Q830223 wikiPageWikiLink Q6397419.
- Q830223 wikiPageWikiLink Q646477.
- Q830223 wikiPageWikiLink Q6787153.
- Q830223 wikiPageWikiLink Q7003418.
- Q830223 wikiPageWikiLink Q7015109.
- Q830223 wikiPageWikiLink Q7572825.
- Q830223 wikiPageWikiLink Q787903.
- Q830223 wikiPageWikiLink Q816319.
- Q830223 wikiPageWikiLink Q828287.
- Q830223 wikiPageWikiLink Q830223.
- Q830223 wikiPageWikiLink Q843684.
- Q830223 wikiPageWikiLink Q852081.
- Q830223 wikiPageWikiLink Q8772745.
- Q830223 wikiPageWikiLink Q8799.
- Q830223 wikiPageWikiLink Q93028.
- Q830223 comment "In computer science, radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value. A positional notation is required, but because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is not limited to integers.".
- Q830223 label "Radix sort".