Double click the Green Flag and then click either of the blue buttons, or the boy in the middle! Explanation: In programming, there are multiple ways of sorting arrays (a way of storing a lot of values, like Scratch's lists). Two of the most common sorting methods are Selection and Insertion sorts. Selection Sort goes through the array and finds the value that should go at the beginning (either biggest or smallest, or in this case red), and puts it at the beginning. This takes a long time, but after X items are moved, the first X items are where they will be at the end. Always takes the same amount of time to sort. Insertion Sort goes takes the second item of the array and determines whether it should go before or after the first item. It then goes to the third, and determines where it should go. In this, you can see the values moving left as the program figures out where they should go. After X items are moved, the first X items are sorted, but not necessarily where they should be when it's completely sorted. Takes the longest time if the list is inverse order, shortest time if list is already sorted.
Made this for studying for the AP Computer Science test.
