Insertion Sort always outperforms Quick Sort on large datasets.

Insertion Sort is not suitable for nearly sorted data.

Insertion Sort requires additional memory proportional to input size.

Insertion Sort has a worst-case time complexity of O(n log n).

Insertion Sort is a stable and in-place sorting algorithm.