1 votes 1 votes A sorting algorithm is stable if duplicate elements remain in the same relative position after sorting. What is the meaning of this statement Algorithms algorithms sorting + – gauravkc asked Jan 24, 2018 • retagged Jun 29, 2022 by makhdoom ghaya gauravkc 249 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes let ...original seuence is this.... 5 9 3(index2) 4 2 6 3(index 6).... after sorting.. 2 3(index2) 3(index 6) 4 5 6 8...Stable.... 2 3(index6) 3(index 2) 4 5 6 8...not...Stable.... hs_yadav answered Jan 24, 2018 • selected Jan 24, 2018 by srestha hs_yadav comment Share Follow See all 0 reply Please log in or register to add a comment.
