Hybrid bucket sort switching internal sorting based on the data inside the bucket

Spreading elements in the designed buckets is one of the major issue of bucket sort. It is a non-comparison sorting algorithm in which different elements are spread over several buckets. It is necessary because sometimes the distribution of elements are not done on equal basis over the buckets. To avoid this problem, In this paper we have proposed a hybrid sort algorithm which is a combination of merge and count sort. Although many researchers are using insertion sort within buckets. But in this paper, we have focused on using insertion sort which is preferable in sorting of low volume of data. The main objective of this work is to use the merge, count, insertion and hybrid sort individually over the buckets and then comparing their results on the basis of sorting benchmark. The threshold (x) value has been set in order to save the time and space of proposed algorithm. Experimental results shown that count sort is very efficient on every dataset in comparison to other algorithms.