Scribd
Upload
129 views

En Bucket Sort

Bucket sort is a stable sorting algorithm that partitions elements into buckets based on their value range. Each bucket is then sorted individually using another sorting algorithm. The sorted buckets are merged together in the output array. Bucket sort runs in O(n+k) time where n is the input size and k is the number of buckets. It can be used for distributed sorting across threads or computers and for huge datasets that don't fit in memory by sorting buckets sequentially.

Uploaded by

Jorman Rincon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
129 views

En Bucket Sort

Bucket sort is a stable sorting algorithm that partitions elements into buckets based on their value range. Each bucket is then sorted individually using another sorting algorithm. The sorted buckets are merged together in the output array. Bucket sort runs in O(n+k) time where n is the input size and k is the number of buckets. It can be used for distributed sorting across threads or computers and for huge datasets that don't fit in memory by sorting buckets sequentially.

Uploaded by

Jorman Rincon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Bucket sort

Bucket sort (bin sort) is a stable sorting algorithm based on partitioning the input array into several parts so called buckets and using some other sorting algorithm for the actual sorting of these subproblems.

Description
At first algorithm divides the input array into buckets. Each bucket contains some range of input elements (the elements should be uniformly distributed to ensure optimal division among buckets).In the second phase the bucket sort orderes each bucket using some other sorting algorithm, or by recursively calling itself with bucket count equal to the range of values, bucket sort degenerates to counting sort. Finally the algorithm merges all the ordered buckets. Because every bucket contains different range of element values, bucket sort simply copies the elements of each bucket into the output array (concatenates the buckets). The asymptotic complexity of bucket sort is number of buckets and , where is size of the input array, is the

is the complexity of the inner sorting algorithm.

Usage
Bucket sort can be used for distributed sorting each bucket can be ordered by a different thread or even by a different computer. Another use case is a sorting of huge input data, which cannot be loaded into the main memory by an ordinary algorithm. This problem can be solved by dividing the data into sufficiently small buckets, sorting them one by one by appropriate algorithm, while storing rest of the data in the external memory ( e.g. hard drive).

Code
Java

/** * Bucket sort * @param array array to be sorted * @param bucketCount number of buckets * @return array sorted in ascending order */ public static int[] bucketSort(int[] array, int bucketCount) { if (bucketCount <= 0) throw new IllegalArgumentException("Invalid bucket count"); if (array.length <= 1) return array; //trivially sorted int high = array[0]; int low = array[0]; for (int i = 1; i < array.length; i++) { //find the range of input elements if (array[i] > high) high = array[i]; if (array[i] < low) low = array[i]; } double interval = ((double)(high - low + 1))/bucketCount; //range of one bucket ArrayList<Integer> buckets[] = new ArrayList[bucketCount]; for (int i = 0; i < bucketCount; i++) { //initialize buckets buckets[i] = new ArrayList(); }

for (int i = 0; i < array.length; i++) { //partition the input array buckets[(int)((array[i] - low)/interval)].add(array[i]); } int pointer = 0; for (int i = 0; i < buckets.length; i++) { Collections.sort(buckets[i]); //mergeSort for (int j = 0; j < buckets[i].size(); j++) { //merge the buckets array[pointer] = buckets[i].get(j); pointer++; } } return array; }

Pavel Mika
Founder and administrator of web encyclopedia Algoritmy.net

You might also like