c++ plus data structures text book 6th ed

A sorting algorithm is stable if elements with equal keys are left in the same order as they occur in the input. Look at the sorting algorithms presented in this chapter. Discuss stable versus unstable ones.

ALGORTHIMS :

Selection sort

bubble sort

insertion sort

merge sort

quick sort

please please be original a i have viewed the other solutions and i really want to gain a deep understanding of this question