Sorting Algorithms.
through the unsorted part, taking one element at a time. Inserting into the Sorted Part: For each element, it finds the correct position in the sorted part and inserts it. Expanding the Sorted Part: The boundary between the sorted and unsorted parts is moved one position to the right. Repeating the