Insertion Sort

Insertion sort is a stable sorting algorithm, meaning that it preserves the relative order of equal elements in the sorted output. When two elements have equal keys, their original order is maintained after sorting. In contrast, selection sort, quick sort, and heap sort do not guarantee this property.

Selection sort

Quick sort is often used as a subroutine in other sorting algorithms due to its efficiency and speed in sorting data. Its partitioning approach can be utilized in algorithms like introsort (a hybrid sorting algorithm), where it provides quick sorting for large datasets. While merge sort is also commonly used in hybrid approaches, quick sort is particularly noted for its versatility and performance in various contexts.