A New Proposed Sorting Algorithm Using Radix Tree and Binning

Abstract

There is a need for new and more efficient ways of sorting numbers. Radix tree is a space efficient way of storing words, which is a more advanced version of a trie. In many radix trees, the words are stored in alphabetical order. The algorithm proposed uses a radix tree to store the numbers, and a traversal algorithm to print them, this method would only work when all the numbers are of equal length. To solve this problem, binning was used after the traversal of the radix tree, to sort the numbers based on their lengths. For testing, many different sizes of datasets were created, of two types. The time taken to sort different datasets has been tested for this algorithm and has been compared to various algorithms such as bubble sort and shell sort. The proposed algorithm performs better than many bubble sort, insertion sort, and selection sort when the size of the datasets is more than 10,000. This algorithm works well when the size of the dataset is large. However, it takes more time comparatively when the size of the dataset is small. The future scope includes using a more optimized radix tree.