permutations.py 1.2 KB

123456789101112131415161718192021222324252627282930313233
  1. # Copyright (C) 2020, 2019 Girish M
  2. # This program is free software; you can redistribute it and/or modify
  3. # it under the terms of the GNU General Public License as published by
  4. # the Free Software Foundation; either version 3 of the License, or
  5. # (at your option) any later version.
  6. #
  7. # This program is distributed in the hope that it will be useful,
  8. # but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. # GNU General Public License for more details.
  11. #
  12. # You should have received a copy of the GNU General Public License
  13. # along with this program; if not, write to the Free Software
  14. # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
  15. # MA 02110-1301, USA.
  16. #
  17. l = ['a', 'b']
  18. def perm(l, start, end):
  19. ''' generate all the permutations of list[start] to list[end] '''
  20. if start==end:
  21. for j in l:
  22. print j
  23. print " "
  24. else:
  25. ''' list[start] to list[end] has more than one permutation, generate these recursively'''
  26. for j in l[start:end]:
  27. l[start], j = j, l[start]
  28. perm(l, start+1, end)
  29. l[start], j = j, l[start] #restore original list
  30. perm(l, 0, 2)