radix sort
In this tutorial you will learn about radix sort program in C.
在本教程中,您将学习C语言中的基数排序程序。
Radix sorting technique is one of the oldest techniques of sorting.
基数排序技术是最古老的排序技术之一。
Lets assume that we are given a list of some names and asked to sort them alphabetically. We would normally proceed by first dividing the names into 26 different sets (since, there are total of 26 alphabets) with each set containing names that start with the same alphabet. In the first set, we will put all the names which start with alphabet ‘A’. In the Second Set, we will put all the names that start with ‘B’ and so on.
让我们假设我们得到了一些名称的列表,并要求它们按字母顺序排序。 通常,我们通常先将名称分为26个不同的集合(因为总共有26个字母),每个集合都包含以相同字母开头的名称。 在第一组中,我们将所有以字母“ A”开头的名称。 在第二组中,我们将放置所有以“ B”开头的名称,依此类推。
Also Read: Quick Sort in C [Program & Algorithm]
另请阅读: