Suppose that in a sequence containing n records, all the keywords are integers between V and W, and many of them are the same values. The sort can be sorted as follows: set another array number[v... The number of records w] and makes the number[i] keyword statistics integer number I, then press number to achieve the orderly sequence rearrangement. Try to write algorithms to implement the above sorting method

Filename	Size	Update
２２	0	2018-01-15
２２\２２	0	2018-01-15
２２\２２.sdf	1527808	2018-01-15
２２\２２.sln	885	2018-01-15
２２\２２.suo	9216	2018-01-15
２２\２２\２.cpp	397	2018-01-15
２２\２２\２２.vcxproj	3915	2018-01-15
２２\２２\２２.vcxproj.filters	941	2018-01-15
２２\２２\２２.vcxproj.user	143	2018-01-15
２２\ipch	0	2018-01-15
２２\ipch\２２-e10d724d	0	2018-01-15
２２\ipch\２２-e10d724d\２２-433841f0.ipch	1441792	2018-01-15

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．