Which sort algorithm works best on mostly sorted data?

For sorting mostly sorted data, insertion sort is the most efficient algorithm[1][2][4]. Insertion sort has a time complexity of O(n) in the best case when the input is already sorted, making it ideal for nearly sorted data sets[2][4].

The algorithm works by iterating through the array, removing one element at a time, and inserting it into its correct position in the sorted portion of the array[4]. Since the input is mostly sorted, the elements will only need to be shifted a small distance to their correct position, resulting in very few swaps and a fast sorting time[1][2].

In contrast, comparison-based sorting algorithms like merge sort and quick sort do not adapt well to nearly sorted data and maintain their O(n log n) time...