计数排序

                                                                                            

import java.util.Arrays;
import java.util.Scanner;

/**
 *  example:
		 下标                0   1   2  3  4  5  6  7
		 arrays   8   7   6  5  4  3  2  1
		 count    7   6   5  4  3  2  1  0      比数组其他值大的值
	    newarrays     newarrays[count[i]]=arrays[i]
	                       比如当i=0;  newarrays[count[0]]=arrays[0]  即 newarrays[7]=8; 
 *  
 *  
 */
public class CountSort {
	public static void main(String[] args) {
		System.out.println("请输入8个数字");
		Scanner sc1 = new Scanner(System.in);
		int arrays[] = new int[8];
		// 初始化
		for (int i = 0; i <= arrays.length - 1; i++) {
			arrays[i] = sc1.nextInt();
		}
		
		//计数排序及输出新的排序数组
		int newarrays[] = new int[8];
		int count[] = new int[8];

		for (int i = 0; i <= arrays.length - 1; i++) {
			int number = 0;
			for (int k = 0; k <= arrays.length - 1; k++) {
				if (i == k || arrays[i] <= arrays[k]) {
					continue;
				} else {
					number++;
				}
			}
			count[i] = number;
			newarrays[count[i]] = arrays[i];
		}
		System.out.println(Arrays.toString(newarrays));
	}
}