Counting 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.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 55

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.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 54

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.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 54

Simple yet powerful algorithm. Learn how to efficiently arrange elements, understand time complexity, and enhance your sorting skills. Dive in now!

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.

Data Structures

Certificate on completion

• 9
• 3
• 1
• 52