Linear O(N) sorting with Radix Sort (2000)

Re:Linear O(N) sorting with Radix Sort (2000) by wruza on Tuesday February 01, 2022 @07:31AM (#30161621)

a radix is just a digit in a decimal number. For example the number «42» has two digits, or two radices, which are 4 and 2. In hexadecimal the radix is 8 bits wide. For example the hexadecimal number 0xAB has two radices, A and B

Possibly a typo, A and B are 4 bits wide each.

[ Parent | on HN ]

Re:Linear O(N) sorting with Radix Sort (2000) by cb321 on Tuesday February 01, 2022 @08:21AM (#30162003)

I would say the author is also confusing the words "digit" and "radix".

   From The Free On-line Dictionary of Computing (30 December 2018) [foldoc]:

   radix

       <mathematics> The ratio, R, between the weights of adjacent
       digits in {positional representation} of numbers.  The
       right-most digit has weight one, the digit to its left has
       weight R, the next R^2, R^3, etc.  The radix also determines
       the set of digits which is zero to R-1.  E.g. decimal (radix
       ten) uses 0-9 and each digit is worth ten times as much as you
       move left along the number.

       (2006-11-10)

Admittedly, "digit distribution sort" might be a more descriptive name for the algorithm.

[ Parent | on HN ]