算法入门——简化版桶排序

package test;
import java.util.Scanner;
public class 桶排序2 {
public static void main(String[] args) {
int[] array = new int[1001];
for(int i = 0;i<=1000;i++){
array[i]=0;
}
Scanner in = new Scanner(System.in);
int a = in.nextInt();
for(int i = 1;i<=a;i++){
int b = in.nextInt();
array[b]++;
}

for(int i = 0;i<=1000;i++){
for(int j = 1;j<=array[i];j++){
System.out.println(i);
}
}
}
}
/*
定义数组的三种方法
int[] arr1=new int[10];
int[] arr2={1,2,3,6};
int[] arr3=new int[]{1,2,3,4,5,6,7,22};
*/
/*
java输入
import java.util.Scanner;
Scanner in = new Scanner(System.in);
*/