D. S. R.

Murthy DSA-7 Sorting, Sets, and Selection (contd…) 1

Bucket Sort
Radix Sort
Comparison of Sorting algorithms
Randomized Quick-Select method

Bucket Sort
Simple distributive sorting method.

Involves examining the least significant digit of the

keyword first, and the item is then assigned to a
bucket uniquely dependent on the value of the
digit.

After all items have been distributed, the buckets

items are arranged in order.

The process is repeated until no more digits are

left.

A number system of base P requires P buckets.

D. S. R. Murthy DSA-7 Sorting, Sets, and Selection (contd…) 2

Example:
19, 13, 05, 27, 01, 26, 31, 16, 02, 09, 11, 21.

Unsorted First Merge Second Merge

digit digit (Sorted)

19 01 01

13 0) 31 0) 01, 02, 05, 09 02

05 1) 01, 31, 11, 21 11 1) 11, 13, 16, 19 05

27 2) 02 21 2) 21, 26, 27 09

01 3) 13 02 3) 31 11

26 4) 13 4) 13

31 5) 05 05 5) 16

16 6) 26, 16 26 6) 19

02 7) 27 16 7) 21

09 8) 27 8) 26

11 9) 19, 09 19 9) 27

21 09 31
D. S. R. Murthy DSA-7 Sorting, Sets, and Selection (contd…) 3

Radix Sort
Distributive sorting method.

Applicable when the keys are expressed in binary

form.

Consider groups with the same (M) first bits and

order the group with respect to the (M+1)st bit.

Ordering of a group on a given bit is accomplished

by scanning down from the top of the group for a
one bit and up from the bottom for a zero bit;
these two are exchanged and the sort continues.

Example:
19, 13, 05, 27, 01, 26, 31, 16, 02, 09, 11, 21.
Unsorted Pass1 Pass2 Pass3 Pass4 Pass5 Sorted
19 10011*T1 01011*T2 00010T3 00010*T4 00001T5,B5 00001
13 01101 01101*00001 00001*B4 00010T6,B6 00010
05 00101 00101 00101B3 00101T7,B7 00101
27 11011* 01001 01001T8 01001T9 01001T10,B1001001
01 00001 00001* 01101*01011B9 01011T11,B1101011
26 11010*00010*B2 01011*B8 01101T12,B12 01101
31 11111 11111*T13 10101*T14 10011T15 10000T16,B1610000
16 10000 10000 10000 10000B15 10011T17,B1710011
02 00010* 11010*10011*B14 10101T18,B18 10101
09 01001* 11011 11011T19 11011T20 11010T21,B2111010
11 01011*10011*11010 11010B20 11011T22,B2211011
21 10101B1 10101*B13 11111B19 11111T23,B23 11111
D. S. R. Murthy DSA-7 Sorting, Sets, and Selection (contd…) 4

Comparison of Sorting algorithms

Insertion sort Excellent for sorting small sequences.

Merge sort Excellent where the input cannot all

fit into main memory.

Heap-sort Best choice in real-time applications.

Randomized Quick-Select method

1. Select a random element x (Pivot) from S.

2. Remove all the elements from S.

3. Put them into three sequences:

• L, storing the elements in S < x.
• E, storing the elements in S = x.
• G, storing the elements in S > x.