How to realize cardinality sorting in Java

This article shows you how to achieve cardinality sorting in Java, the content is concise and easy to understand, it will definitely brighten your eyes. I hope you can get something through the detailed introduction of this article.

Cardinal sort (radix sort) is also called bucket sort (bucket sort).

Public class RadixSort {private static void radixSort (int [] array,int d) {int nasty 1 corresponding to the number of characters / representative digits: 1meme 10100. Int kumb0ramp / save the sorted result of each bit for the next bit, enter int length=array.length; int [] [] bucket=new int [10] [length]; / / the sort bucket is used to save the result after each sort, and the numbers with the same sorting result on this bit are put in the same bucket int [] order=new int [length]; / / to save how many digits there are in each bucket (n