midSorting
What is Bucket Sort?
Updated Apr 28, 2026
Short answer
A distribution-based sort that partitions elements into several buckets and sorts them individually.
Deep explanation
Intermediate sorting algorithms focus on O(n log n) efficiency and specialized constraints. A distribution-based sort that partitions elements into several buckets and sorts them individually.
Real-world example
Standard library sort implementations (e.g., Python's Timsort).
Common mistakes
- Forgetting that Merge Sort requires O(n) extra space.
Follow-up questions
- Is Quick Sort stable?
- Time complexity of Heap Sort?