Insertion Sort

Insertion Sort is a method of organizing a list of items by gradually building a sorted section. It works by taking each item from the unsorted part and inserting it into its correct position within the sorted part. Think of it like sorting playing cards in your hand: you pick a card and insert it into the right place among the cards you’ve already sorted. This process repeats until all items are in order. It’s simple and effective for small datasets, but can be less efficient for larger lists.