基数ソート
1. Radix sortIn 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.
Read “Radix sort” on English Wikipedia
Read “基数ソート” on Japanese Wikipedia
Read “Radix sort” on DBpedia
Read “Radix sort” on English Wikipedia
Read “基数ソート” on Japanese Wikipedia
Read “Radix sort” on DBpedia
Discussions
Log in to talk about this word.