Algorithms
Data Structures and Algorithms
Data Structures and Algorithms
| Hi-index | 0.00 |
This article analyzes an independently developed sorting technique. Radix or "Bin" sorting is not new, but has been dismissed as a technique, which is intellectually demanding, or of limited use. This independently developed sorting technique utilizes the Radix sort with a refinement. This refined sorting technique, called RRadix sorting (Refined Radix), places a record in a position based on an arbitrary scale that defines where it should be in a list. This article explains how RRadix sorting works. Included in this article is a statistical comparison of RRadix sorting with other, popular sorting techniques.