 It also can be modified to provide stable behavior.Bucket sort is a divide and conquer sorting algorithm that generalizes counting sort by partitioning an array into a finite number of buckets.Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm.