A project that showcases four different sorting algorithms that computers can use. Press space to see the numbers being shuffled. While showing visualization can make the sorting interesting to watch, the sorting process will be much faster and cause less lag with visualization off. A higher number of items will also cause the project to run slower. Random: Items are randomly shuffled until they become sorted. This has a possibility of never sorting the items, and the more items there are the less likely they are to be sorted. Insert: Each item is compared to the item to the left of it, and they switch places if they aren't in order, until the first item is in its correct spot. Bubble: Each item is compared to the item next to it, and they switch places if they are in the wrong order. Selection: Each item is compared to all the other items in the list, and it trades places with the item in its place. I also attempted to add merge sorting, but I found it too hard to implement using Scratch, because of the number of lists needed, depending on the number of items. Note: Selection sort sometimes doesn't work, especially with larger amounts of items or at higher speeds. I'm unsure for now how to fix this.
