Insertion Sort: A simple sorting algorithm that builds the final sorted array one item at a time. It's efficient for small data sets and is often used as part of more sophisticated algorithms. Time Complexity: O(n²) in worst and average cases, O(n) in best case.