bucket sort

(redirected from Bucket sorting)

bucket sort

A variety of sorting techniques that reserve an array of fields in memory (buckets), the number of which is based on the values in the key being sorted. See pigeonhole sort, counting sort and sort algorithm.
References in periodicals archive ?
We call this method "truncated BWT." We also use truncated BWT in this paper, but the limited length is different because we do not use SA, and we use bucket sorting instead of traditional merging or comparing-based sorting.
(3) CZ-BWT uses bucket sorting instead of traditional merging or comparing based sorting.
Since the sting sorting is changed into integer sorting, CZ-BWT can use bucket sorting. When we use truncated strings with k = 3,25[6.sup.3] buckets are needed.
As shown in Figure 7(b), this phase is the 8b integer bucket sorting. The second column is Column 7, and Column 0 stores the input data, which are the output data of CZ-BWT encoding.
As shown in Figure 7(c), this phase is the 16b integer bucket sorting. The bucket array has [2.sup.16] counters, so that we can scan Column [0,7] once and write the sorted data to Column [7,6].
As shown in Figure 7(d), this phase is the 24b integer bucket sorting. The bucket array has [2.sup.24] counters, and we can scan Column [0,7,6] once and write the sorted data to Column [7,6,5].
Phase 4 (outputting along the bucket sorting links).
This is a typical bucket sorting with 256 counters.