DistributionCouting

import java.util.*;public class Test { public static void main(String argv[]) { int[] D = new int[100]; int l=5;int u=8; int n = 10; int[] A = new int[n]; int[] S = new int[n]; for(int i=0;i<n;i++){ A[i]= (int)((Math.random()*(u-l+1))+l); System.out.println(A[i]); } System.out.println(); for(int i=0;i<n;i++){ D[A[i]-l]++; } for(int i=1;i<=u-l;i++){ D[i]=D[i]+D[i-1]; } for(int i=0;i<n;i++){ S[D[A[i]-l]-1]=A[i]; D[A[i]-l]--; } for(int i=0;i<n;i++){ System.out.println(S[i]); } }}