Insertion sort is a sorting system, in which the program creates a sorted list at the beginning of the "pile" of numbers and then inserts numbers into their correct positions. If you give the program numbers, then it can sort them! Then, after it's sorted, you will see how the computer sorted your numbers. You can see inside to learn more about how this works. PLEASE LET ME KNOW WHAT YOU THINK IN THE COMMENTS!
This sorting method is fastest when the data is nearly sorted and slowest when the data is reversed (like 9, 7, 5, 3, and 1) Credit to @exclamational for the bubble sort algorithm project, which inspired me to do this. Go check it out! Link below. https://scratch.mit.edu/projects/107749084/ https://www.toptal.com/developers/sorting-algorithms A nice demo of all of the algorithms 8/18/16: Added/will enhance thumbnail. 8/12/17: Finally figured out hacked blocks! yay!
