Here is the code in Python to print all possible permutation of a list:

def next_perm(arr): # Find non-increasing suffix i = len(arr) - 1 while i > 0 and arr[i - 1] >= arr[i]: i -= 1 if i <= 0: return False # Find successor to pivot j = len(arr) - 1 while arr[j] <= arr[i - 1]: j -= 1 arr[i - 1], arr[j] = arr[j], arr[i - 1] # Reverse suffix arr[i : ] = arr[len(arr) - 1 : i - 1 : -1] print arr return True def all_perm(arr): a = next_perm(arr) while a: a = next_perm(arr) arr = raw_input() arr.split(' ') arr = map(int, arr) arr.sort() print arr all_perm(arr) 

i have used lexicographic order algorithm to get all possible permutations. but recursive algorithm is more efficient and you can find the code for recursive algorithm here Python recursion permutations

Here is the code in Python to print all possible permutations of a list:

def next_perm(arr):  # Find non-increasing suffix  i = len(arr) - 1  while i > 0 and arr[i - 1] >= arr[i]:   i -= 1  if i <= 0:   return False  # Find successor to pivot  j = len(arr) - 1  while arr[j] <= arr[i - 1]:   j -= 1  arr[i - 1], arr[j] = arr[j], arr[i - 1]  # Reverse suffix  arr[i : ] = arr[len(arr) - 1 : i - 1 : -1]  print arr  return True def all_perm(arr):  a = next_perm(arr)  while a:   a = next_perm(arr)  arr = raw_input()  arr.split(' ')  arr = map(int, arr)  arr.sort()  print arr  all_perm(arr) 

I have used a lexicographic order algorithm to get all possible permutations, but a recursive algorithm is more efficient. You can find the code for recursive algorithm here: Python recursion permutations

Here is the code in Python to print all possible permutation of a list:

def next_perm(arr): # Find non-increasing suffix i = len(arr) - 1 while i > 0 and arr[i - 1] >= arr[i]: i -= 1 if i <= 0: return False # Find successor to pivot j = len(arr) - 1 while arr[j] <= arr[i - 1]: j -= 1 arr[i - 1], arr[j] = arr[j], arr[i - 1] # Reverse suffix arr[i : ] = arr[len(arr) - 1 : i - 1 : -1] print arr return True def all_perm(arr): a = next_perm(arr) while a: a = next_perm(arr) arr = raw_input() arr.split(' ') arr = map(int, arr) arr.sort() print arr all_perm(arr) 

i have used lexicographic order algorithm to get all possible permutations. but recursive algorithm is more efficient and you can find the code for recursive algorithm here Python recursion permutations

Here is the code in Python to print all possible permutation of a list:

def next_perm(arr): # Find non-increasing suffix i = len(arr) - 1 while i > 0 and arr[i - 1] >= arr[i]: i -= 1 if i <= 0: return False # Find successor to pivot j = len(arr) - 1 while arr[j] <= arr[i - 1]: j -= 1 arr[i - 1], arr[j] = arr[j], arr[i - 1] # Reverse suffix arr[i : ] = arr[len(arr) - 1 : i - 1 : -1] print arr return True def all_perm(arr): a = next_perm(arr) while a: a = next_perm(arr) arr = raw_input() arr.split(' ') arr = map(int, arr) arr.sort() print arr all_perm(arr) 

i have used lexicographic order algorithm to get all possible permutations. but recursive algorithm is more efficient and you can find the code for recursive algorithm here Python recursion permutations