Second up in the line of sorting algorithms I’ll run through is the insertion sort algorithm. It’s fairly different from the bubblesort algorithm in that bubblesort will go through every element that you’re trying to sort and compare it with every other element (meaning, you’re looking at about n * n comparisons) while insertion sort [...]