Introduction

Sorting is one of the most important operations in computer science. Sorts like Merge Sort or Quick Sort work by comparing pairs of elements.

In this course of the Data Structures Series, we will explore Counting Sort, a non-comparison algorithm. Instead of comparing values, it counts how many times each value appears, then rebuilds the array in order.

Counting Sort shines when the values are non-negative integers in a small range, and it is the building block behind Radix Sort.

This course will include:

• Theory - understand how Counting Sort works.
• Implementation - build it in the programming language of your choice.
• Practice - solve coding challenges based on Counting Sort.

Let's get started!