Counting Sort - DSA Series
Master Counting Sort, a non-comparison algorithm that sorts non-negative integers in linear time by tallying values. Build the counting phase, write the full sort in your language of choice, analyze its O(n + k) complexity, and practice with coding challenges.
Topics
Syllabus
3 chapters9 lessons1 project3 challenges52 quiz questionsIntroduction
2 lessons14The Algorithm
Project5 lessons138Final Challenges
2 lessons2More like this
Radix Sort - DSA Series
Master Radix Sort, a non-comparison algorithm that sorts non-negative integers digit by digit. Build the stable counting-sort pass, write the full sort in your language of choice, analyze its linear-time behavior, and practice with coding challenges.
Certificate on completion
- 9
- 3
- 1
- 55
Heap Sort - DSA Series
Master Heap Sort, the array-based binary heap turned into a sorting algorithm. Build the sift-down step, write the full sort in your language of choice, analyze its O(n log n) time and O(1) space, and practice with coding challenges.
Certificate on completion
- 9
- 3
- 1
- 54
Selection Sort - DSA Series
Master Selection Sort, one of the simplest sorting algorithms. See how it works step by step, build it from scratch in your language of choice, analyze its complexity, and practice with coding challenges.
Certificate on completion
- 9
- 3
- 1
- 54
Insertion Sort - DSA Series
Simple yet powerful algorithm. Learn how to efficiently arrange elements, understand time complexity, and enhance your sorting skills. Dive in now!
- 9
- 3
- 1
Merge Sort - DSA Series
Master Merge Sort, the classic divide and conquer algorithm. Build the merge step, write the full recursive sort in your language of choice, analyze its O(n log n) complexity, and practice with coding challenges.
Certificate on completion
- 9
- 3
- 1
- 52
Frequently asked questions
How many lessons does Counting Sort - DSA Series have?
What does Counting Sort - DSA Series cover?
Is Counting Sort - DSA Series free?
