BUCKET SORT

  

Copyright © Philip M. Parker, INSEAD. Terms of Use.

BUCKET SORT

Specialty Definition: BUCKET SORT

DomainDefinition

Math

A distribution sort where input elements are initially distributed to several buckets based on an interpolation of the element's key. Each bucket is sorted if necessary, and the buckets' contents are concatenated. (references)

Source: compiled by the editor from various references; see credits.

Top     

Specialty Definition: Bucket sort

(From Wikipedia, the free Encyclopedia)

Bucket sort is a sort algorithm that works by partitioning an array into a finite number of buckets and then sorting each bucket. It is a generalization of pigeonhole sort. Bucket sort runs in linear time (&Theta(n)) when input is drawn from a uniform distribution.

It works as follows:

  1. Set up an array of initially empty "buckets" the size of the range.
  2. Go over the original array, putting each object in its bucket.
  3. Sort each non-empty bucket.
  4. Put elements from non-empty buckets back into the original array.

Pseudocode

' A is the array
' n is the number of buckets
' MSBITS(n) returns the most significant bits of n.
'    This could be k*n for sorting numbers, or
'    the first character of n for sorting strings.
' NEXT-SORT is a sort algorithm
BUCKET-SORT(A, n, MSBITS, NEXT-SORT):
  make array B of n lists
  for i = 1 to n:
    insert A[i] into list B[MSBITS(A[i])]
    for i = 0 to n - 1:
      NEXT-SORT(B[i])
  concatenate the lists B[0]...B[n-1] in order

Relationships to other sorting algorithms

Using BUCKET-SORT itself as the NEXT-SORT produces a relative of the radix sort. Using BUCKET-SORT with n == 2 and itself as the NEXT-SORT produces quicksort.

Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Bucket sort."

Top     

Crosswords: BUCKET SORT

Specialty definitions using "BUCKET SORT": comparison sorthistogram sortrange sort. (references)

Top     

Frequency of Internet Keywords: BUCKET SORT

The following statistics estimate the number of searches per day across the major English-language search engines as identified by various trade publications. Hyperlinks lead to commercial use of the expression at Amazon.com.
 
ExpressionFrequency
per Day

bucket sort

6
Source: compiled by the editor from various references; see credits.

Top     

Anagrams: BUCKET SORT

Scrabble® Enable2K-Verified Anagrams

Words within the letters "b-c-e-k-o-r-s-t-t-u"

-2 letters: brockets, buttocks, obstruct, roebucks.

-3 letters: becrust, becurst, bescour, bettors, brocket, buckers, buckets, buckoes, butters, buttock, cotters, couters, curtest, cutters, obscure, obtuser, outsert, restock, rockets, roebuck, scouter, scutter, stocker, stouter, touters, tuckers, tuckets, turbots.

-4 letters: bettor, bosker, bosket, bourse, brocks, brutes, bucker, bucket, buckos, burets, burkes, busker, buster, buteos, butter, buttes, cerous, corset, coster.

Source: compiled by the editor from various references; see credits.

SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.

Top     

Alternative Orthography: BUCKET SORT


Hexadecimal (or equivalents, 770AD-1900s) (references)

42 55 43 4B 45 54      53 4F 52 54

Leonardo da Vinci (1452-1519; backwards) (references)

    

Binary Code (1918-1938, probably earlier) (references)

01000010 01010101 01000011 01001011 01000101 01010100 00100000 01010011 01001111 01010010 01010100

HTML Code (1990) (references)

&#66 &#85 &#67 &#75 &#69 &#84 &#32 &#83 &#79 &#82 &#84

ISO 10646 (1991-1993) (references)

0042 0055 0043 004B 0045 0054      0053 004F 0052 0054

Encryption (beginner's substitution cypher): (references)

365537453954253495254

Top     



INDEX

1. Crosswords
2. Expressions: Internet
3. Anagrams
4. Orthography
5. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.