Question

how can we modify insertion sort to be a stable algorithm sort

​

Answer 1

Explanation:

There can be sorting algo specific ways to make it stable, but in general, any comparison based sorting algorithm which is not stable by nature can be modified to be stable by changing the key comparison operation so that the comparison of two keys considers position as a factor for objects with equal keys.

Answer 2

A sorting algorithm is said to be stable if two equally keyed objects appear in the same order

• If two key elements with identical keys typically occur in the categorized output in a fashion close to the unsorted array of local inputs, the sorting algorithm is steady
• Some Sorting Algorithms are naturally stable, like Insertion Sort, Merge Sort and Bubble Sort etc.
• Insertion sort is a sorting algorithm operating satisfactorily in a similar method as to hands are sorted while playing cards.  
• The dynamic array is virtually divided into an unsorted and properly sorted part.
• Values are selected from the unsorted part and put in the sorted part at the accurate location.