insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. we will write a function that takes in an array of integers and returns a sorted version ...