Classic sorting algorithm-proxmap sort

Classic sorting algorithm-proxmap sort

This sorting is an improvement of Bucket sorting and base sorting. It is easy to understand the first two.

First, let's recall what the bucket sorting is like. The difference between the bucket sorting rule and the bucket sorting rule is that bucket 1 is in bucket 1 and bucket 2 is in bucket 2.

This sort partitions the numbers and then gives a so-called key. For example, it specifies that all 0-9 are entered into the bucket 0.

Both 10-19 and 1 buckets, so that the bucket coverage will increase by 10 times, which is useful in some cases.

With the basis of the bucket arrangement, you can see everything in the two pictures below and no longer break down the process.

Figure 1

Figure 2

 

 

Back to main directory [classic Sorting Algorithm] [Collection]