Which sorting algorithm is best for an already (almost) sorted array?

Insertion sort performs very well on already sorted or almost sorted arrays because few shifts are needed.