Insertion Sort is a simple sorting algorithm that arranges elements in an array one by one. It is efficient for small datasets but not ideal for large lists. This algorithm becomes more efficient when given a partially sorted list as input