Insertion sort

Why Insertion sort is called insertion sort? Insertion sort is called "insertion sort" because it sorts a list by repeatedly taking the next unsorted element and inserting it into its correct position within the already sorted part of the list. Worki...