Question

Example of insertion sort as a stable sort

Answer 1

Two keys appear in same order

Answer 2

A sorting algorithm is said to be stableif two objects with equal keys appear in the same order in sorted output as they appear in the input unsorted array.

Some sorting algorithms are stable by nature like Insertion sort, Merge Sort,Bubble Sort, etc.

I hope it helps u.....