Insertion Sort, Algorithms, Data Structure Algorithm, Coding Interviews, Job Hunting.
that are equal is called a stable sort. Let us understand this with an example – Input — 4A 5 3 2 4B 1 Output — 1 2 3 4A 4B 5 Note: Subscripts are for better understanding. So, Yes, insertion sort is a stable sorting technique, as it does not change the relative order of elements that are equal. Is