[SORT ALGORITHMS]In this assignment you will study insertion sort to understand how it works and what performance you can expect from it. The information found in this assignment will answer questions people have about sorting. A controlled test was performed and the results were quite surprising. Introduction Have you ever wondered which types of types work more efficiently than others under certain conditions? In this report, light will be shed on the existing types of insertion orders and their efficiency. Different list sizes will be used to test this. The types of insertion sort are namely basic insertion sort, double insertion sort and recursive insertion sort. We will also shed light on how Merge Sort works and how efficient it actually is. Sorts are used specifically to sort a list to make things easier to find.Insertion SortDescriptionThe second element of an array is compared to the elements that appear before it. In this case it would be the first item in the list because the sorting has just started. If the list is to be sorted in ascending order, the second element will be swapped with the first element if the second element is smaller than the first element. After this step, the first two elements of an array will be sorted. The third element is then compared to the elements that appear before it. If the third element is less than the first element, it is placed at the position of the first element. If the third element is greater than the first element, but smaller than the second, it is inserted at the position of the second element. If the third element is larger than both elements, it is kept in place as is. The first three items in the list are now sorted. Similarly, quarter and......half of the sheet......and insertion sort works best with small lists and it has been found that when the list size exceeds 2500, the time taken makes a big jump. List of sources2014. Insertion Sort Algorithm in Programming [WWW Document], nd URL http://www.programiz.com/article/insertion-sort-algorithm-programming (accessed 5.17.14).Bender, M.A., Farach-Colton, M., Mosteiro , MA, 2006. Insertion sort is O(n log n)Bulka, D., Mayhew, D., 2000. Efficient C++: Performance Programming Techniques.Cormen, TH, 2001. Introduction to Algorithms.Cutter, P. and Schultz, K. 2004. Homework to use next week: Tutorial presentation. J. of Computing Sciences in Colleges 20(1), October 2004, p. 114.Habibi, M., Fritz, M., Cutler, R., 2004. Cracking the AP Computer ScienceLorentz, R., 1994. Recursive Algorithms.Wang, W., 2011. Beginning Programming All-In-One Desk Reference For Mannequins.