Create a function insertion_sort(). Declare the function with two parameters. The first parameter will be the array. The second parameter will be the length. Iterate through element [1] to element [n-1]. Compare the element [i]. Put it at a suitable index in the array. The array is now sorted. Print the sorted array.