Python data structure and algorithm eighth day "sorting algorithm"

1. Stability of sorting algorithms

A stable sorting algorithm maintains a relative order of records that have the same key value

For example, the following tuples are arranged in ascending order of the first element of a tuple, as follows:

(4,1) (3,1) (3,7) (5,6)

To satisfy the criteria, the possible sorts are:

Situation One:

(3,1) (3,7) (4,1) (5,6)

Situation Two:

(3,7) (3,1) (4,1) (5,6)

While situation one and condition two are satisfied, the condition II breaks the original order without change under the condition of satisfaction.

Python data structure and algorithm eighth day "sorting algorithm"