Description This repository contains a Java implementation of the Radix Sort algorithm, a non-comparative sorting algorithm that sorts numbers by processing individual digits.

Radix sort is an interesting sorting algorithm. It avoids the use of comparisons, rather it uses the digits as indicies to an array (referred to as buckets). Radix sort works by first looking at the ...

We focus on the improvement of data locality for the in-core sequential Radix sort algorithm for 32-bit positive integer keys. We propose a new algorithm that we call Cache Conscious Radix sort, ...

Generally, the single GPU computing method is utilized for the conventional radix sort algorithm based on GPU parallel computing. Nevertheless, as the data scale grows, the single GPU sorting ...

We don’t go over this in any video lectures, but in case you’re interested here’s a quick implementation of radix sort for strings. We work from right to left, and make use of the fact that char types ...

In their book 'Algorithms to Live By', British scientist Professor Brian Christian and science writer Tom Griffith said sock-pairers should try using an algorithm known as a radix sort.