learning$algorithms

Counting Sort

PrevNext
Term side of the Card
Topic: Sorting Algorithms
Unit title: Counting Sort
Categories: Algorithm
Explanation side of the Card

Explanation: The non-comparative sorting algorithm that counts occurrences of each value. Best for small ranges of integers, achieving linear O(n + k) complexity.

Edit on GitHubContributions in our content repository are 🤗 welcome from everyone.Link leads to the Contributions guidelines on GitHubLink leads to the content repository on GitHub