List sorting instances in Python

This article mainly introduces the List sorting instances in Python. This article provides nine List sorting instances. For more information, see the following, python provides two methods to sort the given List L:

Method 1. sort by the List member function sort
Method 2. use the built-in function sorted for sorting (starting from 2.4)

The two methods are similar in use. The first method is used as an example to explain:

From Python2.4, the sort method has three optional parameters, which are described in the Python Library Reference.

The code is as follows:

Cmp: cmp specifies a custom comparison function of two arguments (iterable elements) which shold return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal, or larger than the second argument:
"Cmp = lambda x, y: cmp (x. lower (), y. lower ())"
Key: key specifies a function of one argument that is used to extract a comparison key from each list element: "key = str. lower"
Reverse: reverse is a boolean value. if set to True, then the list elements are sorted as if each comparison were reversed. in general, the key and reverse conversion processes are much faster than specifying
Equivalent cmp function. This is because cmp is called multiple times for each list element while key and reverse touch each element only once.

The following are specific instances of sort.
Instance 1:

The code is as follows:

>>> L = [2, 3, 1, 4]
>>> L. sort ()
>>> L
>>> [1, 2, 4]

Instance 2:

The code is as follows:

>>> L = [2, 3, 1, 4]
>>> L. sort (reverse = True)
>>> L
>>> [4, 3, 2, 1]

Instance 3:

The code is as follows:

>>> L = [('B', 2), ('A', 1), ('C', 3), ('D', 4)]
>>> L. sort (cmp = lambda x, y: cmp (x [1], y [1])
>>> L
>>> [('A', 1), ('B', 2), ('C', 3), ('D', 4)]

Instance 4:

The code is as follows:

>>> L = [('B', 2), ('A', 1), ('C', 3), ('D', 4)]
>>> L. sort (key = lambda x: x [1])
>>> L
>>> [('A', 1), ('B', 2), ('C', 3), ('D', 4)]

Instance 5:

The code is as follows:

>>> L = [('B', 2), ('A', 1), ('C', 3), ('D', 4)]
>>> Import operator
>>> L. sort (key = operator. itemgetter (1 ))
>>> L
>>> [('A', 1), ('B', 2), ('C', 3), ('D', 4)]

Instance 6: (DSU method: Decorate-Sort-Undercorate)

The code is as follows:

>>> L = [('B', 2), ('A', 1), ('C', 3), ('D', 4)]
>>> A = [(x [1], I, x) for I, x in enumerate (L)] # I can confirm the stable sort
>>> A. sort ()
>>> L = [s [2] for s in A]
>>> L
>>> [('A', 1), ('B', 2), ('C', 3), ('D', 4)]

In the preceding section, we use the List sorting method in step 6. instance 3.4.5.6 can be used to sort an item in List item.
Sort the comparison keywords.
Efficiency comparison:

The code is as follows:

Cmp <DSU <key

Through experimental comparison, Method 3 is slower than method 6, method 6 is slower than method 4, and method 4 and method 5 are basically equivalent.
Sort multiple keywords by comparison:
Instance 7:

The code is as follows:

>>> L = [('D', 2), ('A', 4), ('B', 3), ('C', 2)]
>>> L. sort (key = lambda x: x [1])
>>> L
>>> [('D', 2), ('C', 2), ('B', 3), ('A', 4)]

We can see that the sorted L is only sorted by the second keyword. if we want to use the second keyword
After sorting, what about sorting with the first keyword? There are two methods
Instance 8:

The code is as follows:

>>> L = [('D', 2), ('A', 4), ('B', 3), ('C', 2)]
>>> L. sort (key = lambda x :( x [1], x [0])
>>> L
>>> [('C', 2), ('D', 2), ('B', 3), ('A', 4)]

Instance 9:

The code is as follows:

>>> L = [('D', 2), ('A', 4), ('B', 3), ('C', 2)]
>>> L. sort (key = operator. itemgetter (1, 0 ))
>>> L
>>> [('C', 2), ('D', 2), ('B', 3), ('A', 4)]

Why does instance 8 work? The reason is that tuple is compared from left to right. after comparison, if
Equal, compared to the second