Best simple sort for nearly sorted data

A list of 10,000 transactions is already sorted by time except for a handful of late arrivals. Which simple algorithm handles this especially well?