59 examples (0.03 sec)
• Info 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. more...
• The best case for radix sort is that they are taken as consecutive bit patterns.
• This idea can be extended to any number of keys, and is leveraged by radix sort.
• This is called a least significant digit radix sort.
• Radix sort, such as two pass method where counting sort is used during the first pass of each level of recursion, has a large constant overhead.
• This algorithm is based on radix sorting and has the following steps.
• For more restricted data, such as numbers in a fixed interval, distribution sorts such as counting sort or radix sort are widely used.
• It is a distribution sort, and is a cousin of radix sort in the most to least significant digit flavour.
• A simple version of an LSD radix sort can be achieved using queues as buckets.
• MSD radix sorts work the other way around.
• Some MSD radix sorts use one level of buckets in which to group the keys.
• It is common for the counting sort algorithm to be used internally by the radix sort.
• Neither in-place binary-radix sort nor n-bit-radix sort, discussed in paragraphs above, are stable algorithms.
• A hybrid sorting approach, such as using insertion sort for small bins improves performance of radix sort significantly.
• Instead of using radix sorting, it uses hashing to compute L i 's and their intersections.
• In-place MSD binary-radix sort can be extended to larger radix and retain in-place capability.
• Top-down radix sort can be seen as a special case of bucket sort where both the range of values and the number of buckets is constrained to be a power of two.
• In many large applications needing speed, the computer radix sort is an improvement on (slower) comparison sorts.
• LSD radix sorts process the integer representations starting from the least digit and move towards the most significant digit.
• Whether radix sort is equally efficient, less efficient or more efficient than the best comparison-based algorithms depends on the details of the assumptions made.
• An American flag sort is an efficient, in-place variant of radix sort that distributes items into hundreds of buckets.