Bucket sort and radix sort work using a distribute and collect approach without making comparisons. In appropriate use cases, these can be faster than \mathcal{O}(n \log n) algorithms like quicksort ...

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 ...

Add a description, image, and links to the radix-sort topic page so that developers can more easily learn about it.

This project contains a C program that uses a hexadecimal radix sort to sort signed integers taken in from standard input. A simple runner script is also provided for user convenience and ease of ...

ABSTRACT: By analyzing the internal features of counting sorting algorithm. Two improvements of counting sorting algorithms are proposed, which have a wide range of applications and better efficiency ...

Abstract: Many applications depend on efficient sort algorithm to sort large sets of distinct string keys in memory. For example, sorting records for databases in which type of prime key is string. We ...