midSorting
What is Counting Sort?
Updated Apr 28, 2026
Short answer
A non-comparison sort that counts occurrences of each unique element; O(n+k) time.
Deep explanation
Intermediate sorting algorithms focus on O(n log n) efficiency and specialized constraints. A non-comparison sort that counts occurrences of each unique element; O(n+k) time.
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?