Bucket sort

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Average performance

O ( n + n 2 k + k ) {\displaystyle O\left(n+{\frac {n^{2}}{k}}+k\right)} , where k is the number of buckets. O ( n ) , when k ≈ n {\displaystyle O(n),{\text{when }}k\approx n} .

Class

Sorting algorithm

Data structure

Array

Worst-case performance

O ( n 2 ) {\displaystyle O\left(n^{2}\right)}

Worst-case space complexity

O ( n + k ) {\displaystyle O(n+k)}