Introduction

Sorting is one of the most important operations in computer science. The sorts you may have seen so far (like Merge Sort or Quick Sort) work by comparing pairs of elements.

In this course of the Data Structures Series, we will explore Radix Sort, a non-comparison algorithm. Instead of comparing values, it sorts numbers digit by digit.

We will build the LSD (least-significant-digit) version: sort by the ones digit, then the tens digit, then the hundreds, and so on. To keep things clear, this course works with non-negative integers.

This course will include:

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

Let's get started!