Learn more about different bases/number systems with this project: https://scratch.mit.edu/projects/944312474/ When the arrow appears in the bottom-right corner of the screen, click anywhere to advance. This explains how you would go about sorting a list of numbers in order from smallest to largest, using a sorting algorithm called radix sort. Radix sort is one of those algorithms that isn't very easy to visualize just by watching it alone (especially without seeing the numbers), so I thought I'd chime in and cover it. While radix sort is often referred to as an integer-only sorting algorithm, there are actually ways to code it that work on decimals, though they might be a little slower. It can even be used for alphabetizing (alphabetical sorting)! See inside for a prebuilt radix sort (LSD, base 2-10) algorithm.
