A visualisation of an insertion sort. Basically, it takes the yellow line and compares it to the one in red. If the red line is taller than the yellow line, it inserts the yellow line to the left of the red line, else, it continues with the one on its right, until the aforementioned condition is met. After that it sets the line beside the previous yellow line's original position as the new yellow line and the cycle continues until all lines have became the yellow line at least once, then the sort is complete. First post of this alt.
