Algorithm
Bucketl_Sort(A[], Max, Leng) { for i=1 to Max Bucket[i]=-1; for i=1 to Leng Bucket[A[i]]=A[i]; j=0; for i=1 to Max if (Bucket[i]>-1) A[++j]=Bucket[i]; }