Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. When people manually sort cards in a bridge hand, most use a method that is similar to insertion sort.