Analysis & Design of Algorithms

Bucket Sort • Prepared by:-

Sagar Virani
Assistant Professor

Computer Engineering
Department
VVP Engineering College
 Bucket Sort
• It is a comparison-based sorting algorithm.

• Assumption: Input is generated by a random process that distributes

elements uniformly and independently over the interval [0, 1).
• The process of bucket sort can be understood as a scatter-gather approach.
• The elements are first scattered into buckets then the elements of buckets are
sorted.
• Finally, the elements are gathered in order.
 Bucket Sort
• It first divides(scatter) the elements into several groups called buckets.
• Each bucket is filled with a specific range of elements.
• The elements inside each bucket are sorted using any of the suitable sorting
algorithms or recursively calling the same algorithm.
• Finally, the elements of the bucket are combined(gathered) to get the sorted array.
Input list
Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 • Total Number of Elements (n): 10 (Buckets) Initially empty.

0.17
0.39
0.26
0.72
0.94
0.21

0.12
0.23
0.68
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1
0.39 2
0.26 3
0.72 4
0.94 5
0.21 6
0.12 7
0.23 8
0.68 9
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0 • Take first key from the array.

0.17 1
• Multiply the number by no of
0.39 2
buckets(Take the floor value).
0.26 3
• Put the key in the bucket number found
0.72 4
from step 2.
0.94 5
0.21 6 • Key = 0.78
0.12 7 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 bucket no = 0.78 * 10
=  7.8 
=7
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1
0.39 2
0.26 3
0.72 4
0.94 5
0.21 6
0.12 7 0.78
0.23 8
0.68 9
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1
0.39 2
0.26 3
0.72 4
0.94 5
0.21 6 • Key = 0.17
0.12 7 0.78 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 bucket no = 0.17 * 10
=  1.7 
=1
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2
0.26 3
0.72 4
0.94 5
0.21 6
0.12 7 0.78
0.23 8
0.68 9
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2
0.26 3
0.72 4
0.94 5
0.21 6 • Key = 0.39
0.12 7 0.78 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 bucket no = 0.39 * 10
=  3.9 
=3
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2
0.26 3 0.39
0.72 4
0.94 5
0.21 6
0.12 7 0.78
0.23 8
0.68 9
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2
0.26 3 0.39
0.72 4
0.94 5
0.21 6 • Key = 0.26
0.12 7 0.78 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 bucket no = 0.26 * 10
=  2.6 
=2
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6
0.12 7 0.78
0.23 8
0.68 9
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6 • Key = 0.72
0.12 7 0.78 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 bucket no = 0.72 * 10
=  7.2 
=7
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6
0.12 7 0.78 0.72
0.23 8
0.68 9
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6 • Key = 0.94
0.12 7 0.78 0.72 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 bucket no = 0.94 * 10
=  9.4 
=9
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6 • Key = 0.21
0.12 7 0.78 0.72 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 0.94 bucket no = 0.21 * 10
=  2.1 
=2
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2 0.26 0.21
0.26 3 0.39
0.72 4
0.94 5
0.21 6
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17
0.39 2 0.26 0.21
0.26 3 0.39
0.72 4
0.94 5
0.21 6 • Key = 0.12
0.12 7 0.78 0.72 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 0.94 bucket no = 0.12 * 10
=  1.2 
=1
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17 0.12
0.39 2 0.26 0.21
0.26 3 0.39
0.72 4
0.94 5
0.21 6
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17 0.12
0.39 2 0.26 0.21
0.26 3 0.39
0.72 4
0.94 5
0.21 6 • Key = 0.23
0.12 7 0.78 0.72 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 0.94 bucket no = 0.23 * 10
=  2.3 
=2
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17 0.12
0.39 2 0.26 0.21 0.23
0.26 3 0.39
0.72 4
0.94 5
0.21 6
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17 0.12
0.39 2 0.26 0.21 0.23
0.26 3 0.39
0.72 4
0.94 5
0.21 6 • Key = 0.68
0.12 7 0.78 0.72 • Total bucket = 10
0.23 8 • Therefore,
0.68 9 0.94 bucket no = 0.68 * 10
=  6.8 
=6
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17 0.12
0.39 2 0.26 0.21 0.23
0.26 3 0.39
• Perform sorting in each
0.72 4
0.94
bucket by applying
5
0.21 suitable sorting
6 0.68
0.12 algorithms or
7 0.78 0.72
0.23 recursively calling the
8
0.68 0.94 same algorithm.
9
• We will use insertion
sort.
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.17 0.12
0.39 2 0.26 0.21 0.23
0.26 3 0.39
0.72 4
0.94 5
0.21 6 0.68
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.12 0.17
0.39 2 0.26 0.21 0.23
0.26 3 0.39
0.72 4
0.94 5
0.21 6 0.68
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.12 0.17
0.39 2 0.26 0.21 0.23
0.26 3 0.39
0.72 4
0.94 5
0.21 6 0.68
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.12 0.17
0.39 2 0.21 0.23 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6 0.68
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.12 0.17
0.39 2 0.21 0.23 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6 0.68
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.12 0.17
0.39 2 0.21 0.23 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6 0.68
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.12 0.17
0.39 2 0.21 0.23 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6 0.68
0.12 7 0.78 0.72
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.12 0.17
0.39 2 0.21 0.23 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6 0.68
0.12 7 0.72 0.78
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.12 0.17
0.39 2 0.21 0.23 0.26
0.26 3 0.39
0.72 4
0.94 5
0.21 6 0.68
0.12 7 0.72 0.78
0.23 8
0.68 9 0.94
 Bucket Sort
A = <0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68>  

0.78 0
0.17 1 0.12 0.17
0.39 2 0.21 0.23 0.26
0.26 3 0.39
0.72 4 • Concatenate the list B[0],
0.94 5 B[1], B[2]…….. B[n – 1 ]
0.21 6 0.68 in order.
0.12 7 0.72 0.78
0.23 8
0.68 9 0.94

A = <0.12, 0.17, 0.21, 0.23, 0.26, 0.39, 0.68, 0.72, 0.78, 0.94>  
Sorted!!!
 Bucket Sort
Algorithm
BUCKET-SORT(A)
let B[0…..n – 1] be a new array
n = A.length
for i = 0 to n – 1
make B[ i ] an empty list
for i = 1 to n
insert A[ i ] into list B[ nA[ i ] ]
for i =1 to n – 1
sort list B[ i ] with insertion sort
concatenate the lists B[0], B[1]….B[n]
together in order
 Bucket Sort
Analysis
BUCKET-SORT(A)
let B[0…..n – 1] be a new array
n = A.length
for i = 0 to n – 1 Θ(n)

make B[ i ] an empty list

for i = 1 to n Θ(n)

insert A[ i ] into list B[ nA[ i ] ]

for i =1 to n – 1
sort list B[ i ] with insertion sort ?

concatenate the lists B[0], B[1]….B[n] Θ(n)

together in order
 Bucket Sort
Analysis
• Let ni be the random variable denoting the number of elements placed in bucket B[i].
• Since insertion sort runs in quadratic time, the running time of bucket sort is

• Taking expectations of both sides and using linearity of expectation, we have

 Bucket Sort
Analysis
• We define random indicator variables

• Thus,
 Bucket Sort
Analysis
• Therefore,
 Bucket Sort
Analysis

• Indicator random variable Xij is 1 with probability 1/n and 0 otherwise, and therefore

When k ≠ j, the variables Xij and Xik are independent, and hence
 Bucket Sort
Analysis
• Substituting these two expected values

• Therefore, the expected time for bucket sort is Ө(n) + n * O(2 − 1/n) = Ө(n).
 Applications
Bucket sort is used when:
• Input is uniformly distributed over a range.
• There are floating point values.
 Bucket Sort
Disadvantages
• Doesn’t provide in-place sorting.
 Requires additional memory space to sort.
 Pseudo code for Bucket sort Algorithm
BUCKET-SORT (A)
{
let B[0…..n – 1] be a new array
n = A.length
for i = 0 to n – 1
make B[ i ] an empty list
for i = 1 to n
insert A[ i ] into list B[ nA[ i ] ]
for i =1 to n – 1
sort list B[ i ] with insertion sort
concatenate the lists B[0], B[1]….B[n – 1] together in order
}
Any Questions?