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 merge sort. Included is a functional merge sort algorithm, ready for you to use for your projects! Just see inside. Thanks to a video by udiprod on YouTube for giving me some inspiration on how to present this guide. Here it is: https://scratch.mit.edu/discuss/youtube/es2T6KY45cA/
