Which of the following best describes the working of Insertion Sort?

Insertion Sort works by building a sorted sub-list one element at a time. The algorithm iterates through the array, treating each new element as an item to be inserted into its correct position within the already sorted portion of the list. This is done by shifting larger elements one position to the right until the correct spot for the current element is found. Option C accurately describes this process of moving through the array and inserting elements into a growing sorted list.

Option A describes Bubble Sort, which repeatedly swaps adjacent elements.

Option B refers to Selection Sort, where the minimum element is selected and placed at the beginning of the unsorted section.

Option D describes algorithms like Merge Sort or Quick Sort, which divide the problem into smaller sub-problems.

Option C is the correct description of Insertion Sort's mechanism.