Python uses yield to implement full array arrangement

This article mainly introduces python's method of implementing full array arrangement through yield. The example analyzes the concept of full arrangement and yield implementation skills, which has some reference value, for more information about how to use yield to arrange arrays, see the example in this article. Share it with you for your reference. The specific analysis is as follows:

M (m ≤ n) elements from n different elements are arranged in a certain order, which is called an arrangement of m elements from n different elements. When m = n, all data is arranged in full order.
This code uses the yield method to speed up the full arrangement

Def perm (arr, pos = 0): if pos = len (arr): yield arr for I in range (pos, len (arr): arr [pos], arr [I] = arr [I], arr [pos] for _ in perm (arr, pos + 1): yield _ arr [pos], arr [I] = arr [I], arr [pos] for I in perm ([1, 2, 4]): print I

I hope this article will help you with Python programming.