The detailed experimental analysis of bucket sort

The bucket sort is a non-comparison sorting algorithm in which elements are scattered over the buckets. We have concluded, based on state-of-art that most of the researchers have been using the insertion sort within buckets. The other sorting technique is also used in many papers over the buckets. From the state-of-art of bucket sort, we have analyzed that insertion sort is preferable in case of low volume of data to be sorted. In this work, authors have used the merge, count and insertion sort separately over the buckets and the results are compared with each other. The sorting benchmark has been used to test the algorithms. For testing the algorithms, sorting benchmark has been used. We have defined the threshold (τ) defined the threshold for saving the time and space of the algorithms. Results indicate that, count sort comes out to be more efficient within the buckets for every type of dataset.