## bucket sort

28 examples (0.03 sec)
• Info Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. more...
• Like merge sort, external distribution sort also has a main-memory sibling; see bucket sort.
• Bucket sort would be unsuitable for data that have a lot of variation, such as social security numbers.
• For arrays where N is much larger than n, bucket sort is a generalization that is more efficient in space and time.
• Due to the fact that bucket sort must use a limited number of buckets it is best suited to be used on data sets of a limited scope.
• For example, both bucket sort and flashsort are distribution based sorting algorithms.
• Bucket sort with two buckets is effectively a version of quicksort where the pivot value is always selected to be the middle value of the value range.
• Top-down radix sort can be seen as a special case of bucket sort where both the range of values and the number of buckets is constrained to be a power of two.
• If each bucket is sorted using insertion sort, ProxmapSort and bucket sort can be shown to run in predicted linear time.
• The sort in step 2 is usually done using bucket sort or counting sort, which are efficient in this case since there are usually only a small number of digits.
• In the case where the number of bins is at least the number of elements, spreadsort degenerates to bucket sort and the sort completes.
• The classical integer sorting algorithms of bucket sort, counting sort, and radix sort are widely used and practical.
• The Postman's sort is a variant of bucket sort that takes advantage of a hierarchical structure of elements, typically described by a set of attributes.
• Another variant of bucket sort known as histogram sort or counting sort adds an initial pass that counts the number of elements that will fall into each bucket using a count array.
• Bucket sort can be seen as a generalization of counting sort; in fact, if each bucket has size 1 then bucket sort degenerates to counting sort.
• The most common variant of bucket sort operates on a list of n numeric inputs between zero and some maximum value M and divides the value range into n buckets each of size M/n.
• Sorting an input card deck into ascending sequence on a multiple column field, such as an employee number, was done by a radix sort, bucket sort, or a combination of the two methods.
• A demonstration of ProxMapSort, a bucket sort variant that uses intermediate parallel arrays to efficiently index and size its sublists.