単純バケツソート

package com.guo.arithmetic;

import java.util.Scanner;

public class BucketSort {
	public static int m;//        
	public static int n ;//       
	public static int[] book;//      
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//  ：        ，             1，      m， book[m]++;
		//  book[m]          m   。
		
		System.out.println("            ");
		m = sc.nextInt();
		
		System.out.println("             ，         "+m);
		n = sc.nextInt();
		book = new int[m+5];
		for(int i=1;i<=n;i++) {
			System.out.println("    "+i+"  ");
			int m = sc.nextInt();
			book[m]++;
		}
		
		for(int i=0;i<1000;i++) {
			for(int j=0;j