A sorting algorithm puts all the items of a list in order. This project tries to show how Merge Sort works. Apparently, it's one of the faster sorting algorithms - in fact I don't know much about them. You can find more information about sorting algorithms here: https://en.wikipedia.org/wiki/Sorting_algorithm (I should probably read that article, too. XD) I was thinking about how to sort efficiently and I came up with this idea. After looking it up quickly I found out, as I expected, that I wasn't the first to think of it. XD Any comment, question, or suggestion to improve this? Please leave them in the comments! :) I'd specifically like to know how I could improve the speed. Maybe a slightly different approach? I might add other sorting algorithm as well sometime. By the way, I know there are other projects like this on Scratch, that are often better. This project was mostly to test if I could code the algorithm well, but I thought I'd share. :) @MeGacreator22
