High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Enhancing the Efficiency of Radix Sort by using Clustering Mechanism: A Review

Author(s):

Manju Devi , OM Institute of Engineering and Technology, Hisar; Saurabh Charaya, OM Institute of Engineering and Technology, Hisar

Keywords:

Unstable Sorting Algorithm, Clustering Mechanism

Abstract

Sorting is a technique that arranges data in a specific order, whether it be ascending or descending or lexicographical. Various sorting algorithms have been proposed till the time. Radix Sort is one of them. Our aim is to apply clustering mechanism with radix sort. Elements to be sorted are grouped into various clusters on the basis of their distance from each other. For this purpose K-mean clustering algorithm is used. Then these clusters are sorted separately using radix sort. By using this approach efficiency of radix sort has been increased. This Paper is based on the study of various research papers in the field of Radix Sort.

Other Details

Paper ID: IJSRDV4I50417
Published in: Volume : 4, Issue : 5
Publication Date: 01/08/2016
Page(s): 847-850

Article Preview

Download Article