This paper uses the generic form of bucket sort. It is assumed that each integer is between 0 and \(M\) . \(B[1\ldots n]\)  is an array of buckets (for a total number of \(n\)  buckets) which in this implementation are linked lists. Each input element is inserted into a bucket \(B[n\cdot A[i]/M]\) . They are then sorted with the insertion sort, which is decribed in Section REF . A pseudo-code version of bucket sort [1]} is shown in Algorithm REF .
<FIGURE>