Insertion Sort
Insertion Sort is a fundamental comparison-based sorting algorithm that mirrors the way you might sort playing cards in your hand. By building a sorted array one element at a time, it offers simplicity and efficiency, especially for small or nearly sorted datasets.