How to do stable sorting by selection sort? Here is some input like this => 38, 34b, 36, 34a, 1

Question

How to check which comes first 34a or 34b

Answer 1

~ swim ~ Based on Preity mentioning stable sorting, it might be the case where the a and b next to 34 are not actually visible. I think what Preity is trying to ask is how are we supposed to know which 34 comes first and which comes second if we claim that our selection sort algorithm is stable.

That said, it's a little confusing based on their follow-up query. I'll just leave my interpretation of the query here.

Answer 2

~ swim ~ Yeah, in classes, we were taught to handtrace. Can't think of a way immediately either.

... Reference variables, maybe? 🤔

Answer 3

Hatsy Rei your interpretation is correct that's why I make tag of stable selection sort @hatsy and ~ swim ~ sorry for confusion. Yes I've talking about stable sorting and a and b is just invisible for understanding that two different key member with same value are present. So how can I decide which one to take first any way to do that with help of references then how?

Answer 4

~ swim ~

I'm not used that function before will try for that thanks.

But stable sort function in STL is used merge sort as an working procedure. So can't we make some logic as used in merge sort by any divide and conquer technique or any dynamic programming and back tracking

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

So does you guys indicating towards storing the address of input sequence with similar key value and then match that address at sorted result and know if they are at same place as input or not

Answer 5

~ swim ~ OK I'll look over those thank you

Answer 6

~ swim ~ can you help me to know how to sort when number and character both are their on input by selection sort?