Python implements an array-wide arrangement by yield _python

The example in this article describes how Python implements an array-wide arrangement by yield. Share to everyone for your reference. The specific analysis is as follows:

Take M (m≤n) elements from n different elements and arrange them in a certain order, called an arrangement of taking m elements from n different elements. All permutations are called when m=n.
This code uses the yield method, and the full array speed doubles

def Perm (arr, pos = 0):
  if pos = = Len (arr):
    yield arr
  for I in range (POS, Len (arr)):
    Arr[pos], arr[i] = AR R[i], Arr[pos] for
    _ in Perm (arr, pos + 1): Yield _
    Arr[pos], arr[i] = Arr[i], Arr[pos] for
i in Perm ([1,2,3,4 ]):
  Print I

I hope this article will help you with your Python programming.