 Conventionally, insertion sort would be used, but other algorithms could be used as well.Using "bucketSort" itself as "nextSort" produces a relative of radix sort; in particular, the case "n = 2" corresponds to quicksort (although potentially with poor pivot choices).Bucket sort is mainly useful when input is uniformly distributed over a range.