Radix Sort is an integer sorting algorithm where we look at individual integers of a number. Those integers dictate the "buckets" or arrays that the numbers are placed in. We do this enough times until the array of numbers is sorted. It's actually not as bad as Merge Sort or Quick Sort, so don't be afraid!