Improbable Icon

Why is a selection sort algorithm not stable?

Hello All, Can anyone tell me, why is a selection sort algorithm not stable as compare to insertion? If anyone know the tutorial about selection sort in C. Please suggest me.

Selection Sort is not stable because it swaps non-adjacent elements . The most succinct example: Given [2, 2, 1], the ‘2’ values will not retain their initial order. Selection Sort is not stable because it swaps non-adjacent elements.
MySainsburys

Selection Sort is not stable because it swaps non-adjacent elements . The most succinct example: Given [2, 2, 1], the ‘2’ values will not retain their initial order. Selection Sort is not stable because it swaps non-adjacent elements.

NJMCDirect