Insertion Sort is a simple and intuitive sorting algorithm that builds a sorted array one element at a time. It works by taking each element from the unsorted portion and inserting it into its correct position in the sorted portion. This process continues until all elements are sorted. The algorithm is efficient for small data sets and is stable, meaning that it maintains the relative order of equal elements. Although its average and worst-case time complexity is O(n²), it performs well for nearly sorted data, making it a practical choice in certain scenarios.