AlgoViz: Interactive Algorithm Visualization Tool

Bucket Sort

Category: Sorting | Time: O(n + k) | Space: O(n)

Input Data

Visualization

Visual representation of the data structure

Enter an algorithm and input to start visualization.

About Bucket Sort

A distribution sort that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sort algorithm. It is a distribution sort, a generalization of pigeonhole sort that allows for a larger range of keys.

Code Editor

The code is for reference. Editing it won't affect the visualization.

function bucketSort(arr, n = 5) {
    if (arr.length === 0) {
        return arr;
    }
    let min = Math.min(...arr);
    let max = Math.max(...arr);
    let buckets = Array.from({length: n}, () => []);
    for (let i = 0; i < arr.length; i++) {
        let bucketIndex = Math.floor(n * (arr[i] - min) / (max - min + 1));
        buckets[bucketIndex].push(arr[i]);
    }
    for (let i = 0; i < buckets.length; i++) {
        buckets[i].sort((a, b) => a - b);
    }
    let result = [].concat(...buckets);
    return result;
}

What is Bucket Sort?

What is the performance of Bucket Sort?

When should Bucket Sort be used?

Is Bucket Sort stable?

What is the space complexity of Bucket Sort?

How do you determine the number of buckets?

What algorithm is typically used to sort the buckets?

Can Bucket Sort handle negative numbers?

How is Bucket Sort different from Radix Sort?

Is Bucket Sort a comparison-based sort?

Where can I learn more?