Scribd
Upload
13 views26 pages

19-03-2024 0630 PM

Radix sort is a sorting algorithm that sorts numeric keys by grouping them based on their individual digits. It works by sorting the keys based on one digit at a time, starting from the least significant digit. A stable sorting algorithm must be used to sort each column to maintain the relative order of keys with the same digit values. Radix sort proves that any two keys will be in the correct relative order after sorting all digits, as their order is determined by the first digit where they differ.

Uploaded by

Rajareka Rathinam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views26 pages

19-03-2024 0630 PM

Radix sort is a sorting algorithm that sorts numeric keys by grouping them based on their individual digits. It works by sorting the keys based on one digit at a time, starting from the least significant digit. A stable sorting algorithm must be used to sort each column to maintain the relative order of keys with the same digit values. Radix sort proves that any two keys will be in the correct relative order after sorting all digits, as their order is determined by the first digit where they differ.

Uploaded by

Rajareka Rathinam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

Radix Sort 1

Radix Sort
• A key can be thought of as a string of character
from some alphabet.
• If the keys are integers stored in base d, the
alphabet is {0, 1, . . . , d − 1}.
– In base 10, the alphabet is
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}.
– In base 2, the alphabet is {0, 1}.
• Radix sort sorts the keys according to one digit at
a time.
• This is best seen with an example:
123 581 123 123
435 123 435 246
396 763 945 257
945 394 246 394
257 ⇒ 435 ⇒ 257 ⇒ 396
394 945 763 435
246 396 581 581
581 246 394 763
763 257 396 945
↑ ↑ ↑
Radix Sort 2

Radix Sort Details


• How and why did the example work?
• The sort must start with the least significant digit
first. Why?
• We must use a stable sort. Why?
• Assume
– The keys are (at most) d digits.
– Each key is stored in an array of size d
– The least significant digit is first.
• Here is the shell of the algorithm:
RadixSort(int **A, int n,int d) {
for(i=1;i<d;i++)
StableSortColumn(A,n,i);
}
• The routine StableSortColumn(A,n,i) does a
stable sort of the array A based on the values in
column i.
Radix Sort 3

Radix Sort Example 2


• The following list has binary keys, written with
least significant bit on the right. We sort it with
Radix sort, using naive sort on each column.
010 010 000 000
000 000 100 001
101 100 101 010
001 ⇒ 110 ⇒ 001 ⇒ 011
111 101 010 100
011 001 110 101
100 111 111 110
110 011 011 111
↑ ↑ ↑
Radix Sort 4

The Correctness of Radix Sort

We show that any two keys are in the correct relative


order at the end of the algorithm
Proof:
• Assume the keys are stored with least significant
bit on the right.
• Given two keys, let k be the leftmost bit-position
where they differ:
0 1 0 1 1

0 1 1 0 1
k

• At step k the two keys are put in the correct


relative order
• The relative order of the two keys does not
change, since they have the same key in the rest of
the columns, which we stable sort.
Radix Sort 5

Illustration of Correctness
• Consider a sort on an array with these two keys (It
makes no difference what order they are in when
the sort begin):
0 1 1 0 1 0 1 0 1 1

0 1 0 1 1 0 1 1 0 1
k k

• When the sort visits the kth column, the keys are
put in the correct relative order

0 1 0 1 1

0 1 1 0 1

• Because the sort is stable, the order of the two


keys will not be changed when bits > k are
compared

0 1 0 1 1

0 1 1 0 1
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner
Scanned with ACE Scanner

You might also like