Sorting Arrays: Insertion SortInsertion Sort: Insertion sort is an elementary sorting algorithm that sorts one element at a

time. The algorithm takes an element from the list and places it in the correct location in the list. This

process is repeated until there are no more unsorted items in the list.

Computational complexity for insertion sort is O(n2),making it less efficient than more advanced sorting algorithms, such as quick sort, heap sort,

or merge sort, especially for large lists.