Instead of using the data in the counters to move records into a new sequence, the counter data in a rapid sort are used to print each key field along with its corresponding count. See sort algorithm.

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

See sort algorithm. Pigeonhole Sort and Counting Sort In the first pass, after copying the records into their appropriate pigeonholes based on key values, the data wind up sorted.

In this article, we present the bubble sort and merge sort algorithms. We discuss the cycle counts of these algorithms on the Blackfin processor, and show how to reduce the cycle count of the bubble ...

PhD student Timo Bingmann has created an amazing video showing sorting algorithms in action. And it's surprisingly awesome!

In this article, we present the bubble sort and merge sort algorithms. We discuss the cycle counts of these algorithms on the Blackfin processor, and show how to reduce the cycle count of the bubble ...