Bucket Sort
In plain terms
Distributes items into buckets, sorts each, then concatenates.
Going deeper
Bucket sort spreads elements into several buckets by range, sorts each bucket, and joins them. It's fast for uniformly distributed data.
Under the hood
Average O(n) for uniform inputs but degrades if data clusters into few buckets; bucket choice is key.
Examples
Uniformly distributed floats, distributing then sorting, external sorting.
Think of it like...
Like sorting coins into denomination trays, tidying each tray, then stacking them in order.